Data Monoids

Bojanczyk, Mikolaj

doi:10.4230/LIPIcs.STACS.2011.105

Document

Data Monoids

Author Mikolaj Bojanczyk

Part of: Volume: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Symposium on Theoretical Aspects of Computer Science (STACS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2011-03-11

PDF

File

PDF

LIPIcs.STACS.2011.105.pdf

Filesize: 0.53 MB
12 pages

Document Identifiers

DOI: 10.4230/LIPIcs.STACS.2011.105
URN: urn:nbn:de:0030-drops-30030

Subject Classification

Keywords

Monoid
Data Words
Nominal Set
First-Order Logic

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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

Author Details

Mikolaj Bojanczyk

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail