The monoid of queue actions
Formal Languages and Automata Theory
2014-04-23 v1 Group Theory
Abstract
We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic algebraic properties, e.g., conjugacy. Moreover, we show that while several properties concerning its rational subsets are undecidable, their uniform membership problem is NL-complete. Furthermore, we present an algebraic characterization of this monoid's recognizable subsets. Finally, we prove that it is not Thurston-automatic.
Cite
@article{arxiv.1404.5479,
title = {The monoid of queue actions},
author = {Martin Huschenbett and Dietrich Kuske and Georg Zetzsche},
journal= {arXiv preprint arXiv:1404.5479},
year = {2014}
}