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):
Displayed 12 items.
- 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)
- 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)
- ON GROUPS AND COUNTER AUTOMATA (Q3601328) (← links)
- Formal Languages and Groups as Memory (Q3618533) (← links)
- Language classes associated with automata over matrix groups (Q5223619) (← links)
- Automata with Counters that Recognize Word Problems of Free Products (Q5250278) (← links)
- Groups whose word problems are accepted by abelian \(G\)-automata (Q6067344) (← links)