Abstract
Let L be the equality set of two distinct injective morphisms g and h, and let L be generated by at least two words. Recently it was proved ([2]) that such an L is generated by two words and g and h can be chosen marked from both sides. We use this result to show that L is of the form {a i b, ba i}*, with i ≥ 1.
Work supported by institutional grant MSM 113200007
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Ehrenfeucht, J. Karhumäki, and G. Rozenberg, The (generalized) Post correspondence problem with lists consisting of two words is decidable, Theoret. Comput. Sci. 21 (1982), no. 2, 119–144.
Š. Holub, Binary equality sets are generated by two words, J. Algebra, DOI: 10.1016/S0021-8693(02)00534-3, in press.
K. Culik II and J. Karhumäki, On the equality sets for homomorphisms on free monoids with two generators, RAIRO Theor. Informatics 14 (1980), 349–369.
A. Ehrenfeucht, J. Karhumäki and G. Rozenberg, On binary equality sets and a solution to the test set conjecture in the binary case, J.Algebra 85 (1983), 76–85.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holub, Š. (2003). A Unique Structure of Two-Generated Binary Equality Sets. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_21
Download citation
DOI: https://doi.org/10.1007/3-540-45005-X_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40431-6
Online ISBN: 978-3-540-45005-4
eBook Packages: Springer Book Archive