Abstract
We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids. We show that for polycyclic monoids of rank 2 or more, such automata accept exactly the context-free languages. For the polycyclic monoid of rank 1 (that is, the bicyclic monoid), they accept a class of languages strictly including the partially blind one-counter languages. Key to the proofs is a description of the rational subsets of polycyclic and bicyclic monoids, other consequences of which include the decidability of the rational subset membership problem for these monoids, and the closure of the class of rational subsets under intersection and complement.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbucher, Stuttgart (1979)
Book, R.V., Jantzen, M., Wrathall, C.: Monadic Thue systems. Theoretical Computer Science 19, 231–251 (1982)
Book, R.V., Otto, F.: String rewriting systems. Springer, New York (1993)
Fernau, H., Stiebe, R.: Valence grammars with target sets. In: Yu, S., Ito, M. (eds.) Words, Semigroups and Transductions, pp. 129–140. World Scientific, Singapore (2001)
Fernau, H., Stiebe, R.: Sequential grammars and automata with valences. Theoretical Computer Science 276, 377–405 (2002)
Gilman, R.H.: Formal languages and infinite groups. In: Geometric and Computational Perspectives on Infinite Groups, Minneapolis, MN and New Brunswick, NJ, 1994. DIMACS Series Discrete Mathematics and Theoretical Computer Science, Providence R, vol. 25. American Mathematical Society (1996)
Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science 7(3), 311–324 (1978)
Kambites, M.: Formal languages and groups as memory. Communications in Algebra (to appear)
Kambites, M., Silva, P.V., Steinberg, B.: On the rational subset problem for groups. J. Algebra 309(2), 622–639 (2007)
Mitrana, V., Stiebe, R.: Extended finite automata over groups. Discrete Applied Mathematics 108(3), 247–260 (2001)
Paun, G.: A new generative device: valence grammars. Rev. Roumaine Math. Pures Appl. XXV(6), 911–924 (1980)
Render, E., Kambites, M.: Rational subsets of polycyclic monoids and valence automata. arXiv:0710.3711v1 [math.RA]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Render, E., Kambites, M. (2008). Polycyclic and Bicyclic Valence Automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-88282-4_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88281-7
Online ISBN: 978-3-540-88282-4
eBook Packages: Computer ScienceComputer Science (R0)