LIPIcs.STACS.2011.105.pdf
- Filesize: 0.53 MB
- 12 pages
Document
Data Monoids
Author
-
Part of:
Volume:
28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication date: 2011-03-11
Cite AsGet BibTex
Mikolaj Bojanczyk. Data Monoids. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 105-116, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.STACS.2011.105
https://doi.org/10.4230/LIPIcs.STACS.2011.105
Abstract
We develop an algebraic theory for languages of data words. We prove that, under certain conditions, a language of data words is definable in first-order logic if and only if its syntactic monoid is aperiodic.
Keywords
- Monoid
- Data Words
- Nominal Set
- First-Order Logic
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads