The following pages link to ON GROUPS AND COUNTER AUTOMATA (Q3601328):
Displaying 12 items.
- \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
- Automatic presentations for semigroups. (Q1041033) (← links)
- The word problem of \(\mathbb{Z}^n\) is a multiple context-free language (Q1647858) (← links)
- Counter machines and crystallographic structures (Q2003451) (← links)
- The loop problem for Rees matrix semigroups. (Q2481325) (← links)
- Geodesic growth in virtually abelian groups (Q2659140) (← links)
- THE IDEMPOTENT PROBLEM FOR AN INVERSE MONOID (Q3112585) (← links)
- Language classes associated with automata over matrix groups (Q5223619) (← links)
- Anisimov's Theorem for inverse semigroups (Q5246502) (← links)
- Automata with Counters that Recognize Word Problems of Free Products (Q5250278) (← links)
- Groups Whose Word Problem is a Petri Net Language (Q5500697) (← links)
- Free products of semigroups and monoids with a deterministic context-free word problem (Q6663534) (← links)
