Abstract
Motivated by the research on pattern languages, we study a fundamental combinatorial question on morphisms in free semigroups: With regard to any string α over some alphabet we ask for the existence of a morphism σ such that σ(α) is unambiguous, i.e. there is no morphism ρ with \(\rho \not= \sigma\) and ρ(α) = σ(α). Our main result shows that a rich and natural class of strings is provided with unambiguous morphic images.
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
Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21, 46–62 (1980)
Choffrut, C., Karhumäki, J.: Combinatorics of words. In: [14]
Harju, T., Karhumäki, J.: Morphisms. In: [14]
Head, T.: Fixed languages and the adult languages of 0L schemes. Intern. J. of. Computer Math. 10, 103–107 (1981)
Jürgensen, H., Konstantinidis, S.: Codes. In: [14]
Lange, S., Wiehagen, R.: Polynomial-time inference of arbitrary pattern languages. New Generation Comput. 8, 361–370 (1991)
Levé, F., Richomme, G.: On a conjecture about finite fixed points of morphisms. Theor. Comp. Sci. (to appear)
Lipponen, M., P˘aun, G.: Strongly prime PCP words. Discrete Appl. Math. 63, 193–197 (1995)
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)
Mateescu, A., Salomaa, A.: Patterns. In: [14]
Mateescu, A., Salomaa, A.: Finite degrees of ambiguity in pattern languages. RAIRO Inform. Théor. Appl. 28(3-4), 233–253 (1994)
Reidenbach, D.: A non-learnable class of E-pattern languages. Theor. Comp. Sci. (to appear)
Reidenbach, D.: A discontinuity in pattern inference. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 129–140. Springer, Heidelberg (2004)
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1. Springer, Berlin (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freydenberger, D.D., Reidenbach, D., Schneider, J.C. (2005). Unambiguous Morphic Images of Strings. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_22
Download citation
DOI: https://doi.org/10.1007/11505877_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26546-7
Online ISBN: 978-3-540-31682-4
eBook Packages: Computer ScienceComputer Science (R0)