Pages that link to "Item:Q596085"
From MaRDI portal
The following pages link to On groups whose word problem is solved by a counter automaton. (Q596085):
Displaying 20 items.
- Automata, reduced words and Garside shadows in Coxeter groups. (Q279744) (← links)
- Multipass automata and group word problems (Q495997) (← links)
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group (Q557909) (← links)
- On the rational subset problem for groups. (Q875109) (← links)
- The use of Knuth-Bendix methods to solve the word problem in automatic groups (Q1192222) (← links)
- On the definition of word hyperbolic groups. (Q1433428) (← links)
- Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← links)
- On the group memory complexity of extended finite automata over groups (Q2210871) (← links)
- Semigroup automata with rational initial and terminal sets (Q2268859) (← links)
- Word problems recognisable by deterministic blind monoid automata (Q2508978) (← links)
- Cone types and geodesic languages for lamplighter groups and Thompson's group \(F\). (Q2509265) (← links)
- The (nested) word problem (Q2630345) (← links)
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM (Q3146308) (← links)
- ON GROUPS AND COUNTER AUTOMATA (Q3601328) (← links)
- Formal Languages and Groups as Memory (Q3618533) (← links)
- On a subclass of context-free groups (Q3978768) (← links)
- Language classes associated with automata over matrix groups (Q5223619) (← links)
- Automata with Counters that Recognize Word Problems of Free Products (Q5250278) (← links)
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM (Q5465986) (← links)
- The word problem for finitary automaton groups (Q6175091) (← links)
