Language Classes Associated with Automata Over Matrix Groups
Abstract
We investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We look at the computational power of time-bounded group automata where the group under consideration has polynomial growth.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2016
- DOI:
- 10.48550/arXiv.1609.00396
- arXiv:
- arXiv:1609.00396
- Bibcode:
- 2016arXiv160900396S
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory
- E-Print:
- NCMA'16