Abstract
For every natural number n, we classify abelian groups generated by an n-state time-varying automaton over the binary alphabet, as well as by an n-state Mealy automaton over the binary alphabet.
| Original language | English |
|---|---|
| Pages (from-to) | 18-27 |
| Number of pages | 10 |
| Journal | Information and Computation |
| Volume | 249 |
| DOIs | |
| Publication status | Published - 1 Aug 2016 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver