Pages that link to "Item:Q2629888"
From MaRDI portal
The following pages link to Freeness of automaton groups vs boundary dynamics (Q2629888):
Displayed 14 items.
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- On the existence of free subsemigroups in reversible automata semigroups (Q2076067) (← links)
- Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness (Q2190041) (← 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)
- On groups generated by bi-reversible automata: the two-state case over a changing alphabet (Q2396829) (← links)
- On a class of poly-context-free groups generated by automata (Q2700958) (← links)
- A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (Q3451112) (← links)
- A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (Q4640042) (← links)
- (Q5091811) (← links)
- Eraser morphisms and membership problem in groups and monoids (Q5119336) (← links)
- Fragile words and Cayley type transducers (Q5124053) (← links)
- Graph automaton groups (Q5154177) (← links)
- Boundary dynamics for bireversible and for contracting automaton groups (Q5221286) (← links)