Abstract
Let p be a fixed nonnegative integer. We prove the Ehrenfeucht conjecture for morphisms having deciphering delay bounded by p. In other words, we show that for each language L over a finite alphabet there exists a finite subset F of L such that for arbitrary morphisms h and g having deciphering delay bounded by p, the equation h(x)=g(x) holds for all x in L if and only if it holds for all x in F.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Albert, J., Culik, K.II, Karhamäki, J., Test sets for context-free languages and algebraic systems of equations, Information and Control (to appear).
Culik, K. II, Homomorphisms: Decidability, Equality and Test Sets, in: R. Book, ed., Formal Language Theory, Perspectives and Open Problems (Academic Press, New York 1980).
Culik, K. II, Karhamäki, J., On test sets for DOL Languages, RAIRO, Theoretical Informatics (to appear).
Culik, K. II, Karhumäki, J., Systems of equations and Ehrenfeucht Conjecture, Discrete Mathematics 43 (1983) 139–153.
Culik, K. II, Karhumäki, J., On the equality sets for homomorphisms on free monoids with two generators, RAIRO, Theoretical Informatics 14 (1980) 340–369.
Culik, K. II, Salomaa, A., On the decidability of homomorphism equivalence on Languages, JCSS 17 (1978) 163–175.
Culik, K. II, Salomaa, A., Test sets and checking words for homomorphism equivalence, JCSS 19 (1980) 379–395.
Ehrenfeucht, A., Karhumäki, J., Rozenberg, G., On binary equality languages and a solution to the test set conjecture in the binary case, J. of Algebra [to appear).
Ehrenfeucht, A., Karhutnäki, J., Rozenberg, G., The (generalized) Post Correspondence Problem with lists consisting of two words is decidable, Theoretical Computer Science 21 (1982), 119–144.
Ehrenfeucht, A., Rozenberg, G., Ruohonen, K., Maximal solutions of language equations involving morphisms, manuscript (1963).
Harrison, M., Introduction to formal language theory, (Addison-Wesley, Mass. Reading 1978).
Hopcroft, J., Ullman, J., Introduction to Automata Theory, Languages and Computation, (Addison-Wesley, Mass. Reading, 1979).
Lallement, G., Semigroups and Combinatorial Applications (Wiley Interscience, New York, 1979).
Nivat, M., Elements de la théorie générale des Codes, in: E.R. Caianello, ed., Automata Theory (Academic Press, New York, 1966).
Rozenberg, G., Salomaa, A., The Mathematical Theory of L Systems, (Academic Press, New York, 1980).
Salomaa, A., Jewels of Formal Language Theory, (Computer Science Press, 1981).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choffrut, C., Karhumaki, J. (1983). Test sets for morphisms with bounded delay. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036902
Download citation
DOI: https://doi.org/10.1007/BFb0036902
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive