Pages that link to "Item:Q2914713"

The following pages link to Implementing Computations in Automaton (Semi)groups (Q2914713):

Displaying 21 items.

• Automaton semigroups: the two-state case. (Q290910) (← links)
• Automaton semigroups: new constructions results and examples of non-automaton semigroups (Q528468) (← links)
• Automaton semigroup constructions. (Q744860) (← links)
• The word and order problems for self-similar and automata groups (Q784904) (← links)
• On the structure theory of partial automaton semigroups (Q786010) (← links)
• Orbit automata as a new tool to attack the order problem in automaton groups (Q891470) (← links)
• On bireversible Mealy automata and the Burnside problem (Q1685959) (← links)
• An automaton group with undecidable order and Engel problems (Q1693094) (← links)
• On level-transitivity and exponential growth (Q1702514) (← links)
• Permutive one-way cellular automata and the finiteness problem for automaton groups (Q2011658) (← links)
• Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness (Q2190041) (← links)
• A geometric approach to (semi)-groups defined by automata via dual transducers. (Q2256271) (← links)
• Generic properties in some classes of automaton groups (Q2278570) (← links)
• Infinite automaton semigroups and groups have infinite orbits (Q2306651) (← links)
• On the complexity of the word problem for automaton semigroups and automaton groups (Q2363312) (← links)
• Freeness of automaton groups vs boundary dynamics (Q2629888) (← links)
• On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata (Q2799184) (← links)
• Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ (Q2960427) (← links)
• Automorphisms of shift spaces and the Higman--Thompson groups: the one-sided case (Q3382250) (← links)
• A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (Q3451112) (← links)
• (Q5092326) (← links)