A geometric characterization of automatic semigroups
From MaRDI portal
Publication:861269
DOI10.1016/j.tcs.2006.09.008zbMath1155.68039MaRDI QIDQ861269
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.008
68Q45: Formal languages and automata
20M05: Free semigroups, generators and relations, word problems
20M35: Semigroups in automata theory, linguistics, etc.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automatic groups and amalgams
- Notions of automaticity in semigroups.
- Automatic semigroups
- Automatic completely-simple semigroups
- Extensions and submonoids of automatic monoids.
- Remarks concerning finitely generated semigroups having regular sets of unique normal forms
- Automaticity and commutative semigroups
- A Geometric Characterization of Automatic Monoids
- Automatic monoids and change of generators