Formal languages and groups as memory
Group Theory
2011-11-09 v2
Abstract
We present an exposition of the theory of finite automata augmented with a multiply-only register storing an element of a given monoid or group. Included are a number of new results of a foundational nature. We illustrate our techniques with a group-theoretic interpretation and proof of a key theorem of Chomsky and Schutzenberger from formal language theory.
Cite
@article{arxiv.math/0601061,
title = {Formal languages and groups as memory},
author = {Mark Kambites},
journal= {arXiv preprint arXiv:math/0601061},
year = {2011}
}
Comments
15 pages, 1 figure, exposition improved, glitches fixed, references and author's contact details updated