Pages that link to "Item:Q5410736"
From MaRDI portal
The following pages link to THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE (Q5410736):
Displaying 23 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)
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- Permutive one-way cellular automata and the finiteness problem for automaton groups (Q2011658) (← links)
- Corrigendum to: ``Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness'' (Q2130510) (← links)
- Automaton groups and complete square complexes (Q2141714) (← links)
- Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness (Q2190041) (← links)
- Generic properties in some classes of automaton groups (Q2278570) (← links)
- Orbit expandability of automaton semigroups and groups (Q2290646) (← 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 a class of poly-context-free groups generated by automata (Q2700958) (← links)
- An automaton group with \textsf{PSPACE}-complete word problem (Q2701072) (← 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)
- A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (Q3451112) (← links)
- Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
- (Q5092326) (← links)