The Monoid of Queue Actions
We model the behavior of a fifo-queue as a monoid of transformations that are induced by sequences of writing and reading. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic algebraic properties such as 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.
KeywordsNormal Form Basic Action Cayley Graph Regular Language Free Monoid
Unable to display preview. Download preview PDF.
- 1.Berstel, J.: Transductions and context-free languages. Teubner Studienbücher, Stuttgart (1979)Google Scholar
- 7.Duncan, A.J., Robertson, E.F., Ruškuc, N.: Automatic monoids and change of generators. Mathematical Proceedings of the Cambridge Philosophical Society 127, 403–409, 11 (1999)Google Scholar
- 9.Huschenbett, M., Kuske, D., Zetzsche, G.: The monoid of queue actions. preprint arXiv:1404.5479 (2014)Google Scholar
- 11.Kharlampovich, O., Khoussainov, B., Miasnikov, A.: From automatic structures to automatic groups. preprint arXiv:1107.3645 (2011)Google Scholar
- 13.Lentin, A., Schützenberger, M.-P.: A combinatorial problem in the theory of free monoids. In: Combin. Math. Appl., Proc. Conf. Univ. North Carolina 1967, pp. 128–144 (1969)Google Scholar
- 14.Lohrey, M.: The rational subset membership problem for groups: A survey (2013) (to appear)Google Scholar
- 15.Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley (1983)Google Scholar