1. Axioms for Regular Words
- Author
-
Zoltán Ésik and Stephen L. Bloom
- Subjects
Combinatorics ,Operator algebra ,Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) ,Arithmetic ,Variety (universal algebra) ,Concatenation (mathematics) ,Computer Science::Formal Languages and Automata Theory ,Axiom ,Word (group theory) ,Mathematics - Abstract
Courcelle introduced the study of regular words, i.e., words isomorphic to frontiers of regular trees. Heilbrunner showed that a nonempty word is regular iff it can be generated from the singletons by the operations of concatenation, omega power, omega-op power, and the infinite family of shuffle operations. We prove that the nonempty regular words, equipped with these operations, are the free algebras in a variety which is axiomatizable by an infinite collection of some natural equations.
- Published
- 2003