Recommendations
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1544074 (Why is no real title available?)
- scientific article; zbMATH DE number 3389248 (Why is no real title available?)
- Automata and square complexes.
- Automata generating free products of groups of order 2.
- Automata over a binary alphabet generating free groups of even rank.
- Automata, dynamical systems, and groups
- Automaton semigroups
- Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
- CAYLEY AUTOMATON SEMIGROUPS
- Classification of groups generated by 3-state automata over a 2-letter alphabet
- Groups and semigroups defined by colorings of synchronizing automata.
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
- On Burnside's problem on periodic groups
- On a free group of transformations defined by an automaton.
- On a series of finite automata defining free transformation groups.
- On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
- On transition functions of Mealy automata of finite growth.
- The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
- The finiteness problem for automaton semigroups is undecidable.
- The lamplighter group as a group generated by a 2-state automaton, and its spectrum
- The smallest Mealy automaton of intermediate growth.
Cited in
(23)- Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet.
- An automaton group with undecidable order and Engel problems
- On torsion-free semigroups generated by invertible reversible Mealy automata
- scientific article; zbMATH DE number 3949720 (Why is no real title available?)
- On the orbits of automaton semigroups and groups
- scientific article; zbMATH DE number 2223017 (Why is no real title available?)
- scientific article; zbMATH DE number 3949721 (Why is no real title available?)
- A new hierarchy for automaton semigroups
- scientific article; zbMATH DE number 3913692 (Why is no real title available?)
- scientific article; zbMATH DE number 3894482 (Why is no real title available?)
- Permutive one-way cellular automata and the finiteness problem for automaton groups
- Automaton (semi)groups: Wang tilings and Schreier tries
- On groups generated by bi-reversible automata: the two-state case over a changing alphabet
- \((3,2)\)-semigroups generated by \((3,2)\)-automata.
- On the existence of free subsemigroups in reversible automata semigroups
- Two-state Mealy automata of intermediate growth over a two-letter alphabet
- Finite state quotients of free products of monogenic semigroups.
- The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
- The smallest Mealy automaton of intermediate growth.
- scientific article; zbMATH DE number 1762629 (Why is no real title available?)
- On level-transitivity and exponential growth
- On the local invertibility of finite state automata without information loss
- To infinity and beyond
This page was built for publication: Automaton semigroups: the two-state case.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290910)
