Automaton semigroups
From MaRDI portal
Publication:1034622
DOI10.1016/j.tcs.2009.07.054zbMath1194.68133OpenAlexW2911916105MaRDI 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
Related Items (22)
On the complexity of the word problem for automaton semigroups and automaton groups ⋮ Automaton semigroups: the two-state case. ⋮ Implementing Computations in Automaton (Semi)groups ⋮ The identities of the free product of two trivial semigroups ⋮ On a quotient \(S\)-set induced by countably infinite decreasing chains ⋮ Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness ⋮ On the word problem for free products of semigroups and monoids ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries ⋮ The concept of duality for automata over a changing alphabet and generation of a free group by such automata ⋮ Automaton semigroups: new constructions results and examples of non-automaton semigroups ⋮ ITERATION OF INVERTIBLE TRANSDUCTIONS ⋮ Semigroups arising from asynchronous automata. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata ⋮ INVERSE SEMIGROUPS OF PARTIAL AUTOMATON PERMUTATIONS ⋮ Orbit expandability of automaton semigroups and groups ⋮ Automaton semigroup constructions. ⋮ Down closed injectivity and essentialness ⋮ On the structure theory of partial automaton semigroups ⋮ Self-automaton semigroups. ⋮ SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA
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
This page was built for publication: Automaton semigroups
