Automaton semigroups
From MaRDI portal
Publication:1034622
DOI10.1016/j.tcs.2009.07.054zbMath1194.68133MaRDI QIDQ1034622
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.054
68Q45: Formal languages and automata
Related Items
ITERATION OF INVERTIBLE TRANSDUCTIONS, Automaton semigroups: the two-state case., Automaton semigroups: new constructions results and examples of non-automaton semigroups, The concept of duality for automata over a changing alphabet and generation of a free group by such automata, Automaton semigroup constructions., The identities of the free product of two trivial semigroups, Semigroups arising from asynchronous automata., Self-automaton semigroups., On the complexity of the word problem for automaton semigroups and automaton groups, On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata, Implementing Computations in Automaton (Semi)groups, INVERSE SEMIGROUPS OF PARTIAL AUTOMATON PERMUTATIONS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automatic presentations for semigroups.
- On the Burnside problem for periodic groups
- On Burnside's problem on periodic groups
- Automatic semigroups
- Reidemeister-Schreier type rewriting for semigroups
- Automata and square complexes.
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- CANCELLATIVE AND MALCEV PRESENTATIONS FOR FINITE REES INDEX SUBSEMIGROUPS AND EXTENSIONS
- CAYLEY AUTOMATON SEMIGROUPS
- ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
- Generators and relations of direct products of semigroups
- Structure Results for Transitive, Untwisted, Superlinked Finite Covers
- AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
- Word hyperbolic semigroups
- Recursive Unsolvability of a problem of Thue
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Finitely Presented Loops, Lattices, etc. are Hopfian
- STACS 2005
- The lamplighter group as a group generated by a 2-state automaton, and its spectrum