Pages that link to "Item:Q6175091"
From MaRDI portal
The following pages link to The word problem for finitary automaton groups (Q6175091):
Displaying 5 items.
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- The use of Knuth-Bendix methods to solve the word problem in automatic groups (Q1192222) (← links)
- Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← 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)