Data Monoids
Résumé
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.
| Origine | Accord explicite pour ce dépôt |
|---|---|
| Licence |
Loading...