Data Monoids

M. Bojanczyk (1)

1 Institute of Computer Science

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.

Mots clés: Monoid; Data Words; Nominal Set; First-Order Logic

Domaines: Complexité [cs.CC]; Algorithme et structure de données [cs.DS]

M. Bojanczyk. Data Monoids. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.105-116. ⟨hal-00573630⟩