Summary
We study the infinite words generated by an iterated gsm. The motivation was two fold. The first one was given by the apparent similarity between the iterated gsm and the iterated morphism. However contrary to the appearences almost all questions become undecidable. The second one was to disprove the following conjecture of Berstel: The language of coprefixes of an infinite word w is context free iff w is generated by an iterated gsm. We use for that the infinite word: w = abca2 ba 2 bca 4 ba 4 ba 2 ba 4 bc ... (a 2n b)2n c .... We prove also that the degree of the ambiguity problem for coprefixes of iterated gsm is Π 1-complete in the Kleene hierarchy. This result fills the gap between the degree of this problem for iterated morphisms which is Π 0 and for arbitrary context-free grammars which is Π 2-complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Autebert, J.-M., Béauquier, J., Boasson, L., Nivat, M.: Quelques problemes ouverts en théorie des langages algébriques. RAIRO Inf. Theor. 13, 363–379 (1979)
Autebert, J.-M., Beauquier, J., Boasson, L., Latteux, M.: Very small families of algebraic nonrational languages. In: Book, R.V. (ed.) Formal Language Theory, pp. 89–108. New York: Academic Press 1980
Autebert, J.-M., Gabarró, J.: Compléments des facteurs gauches de mots infinis et ambiguité: quelques exemples. Facultat d'Informàtica de Barcelona, Report de Recerca RR85/15, 1985
Autebert, J.-M., Flajolet, P., Gabarro, J.: Prefixes of infinite words and ambiguous context-free languages. Inf. Process. Lett. 25, 211–216 (1987)
Berstel, J.: Some recent results on squarefree words, in STACS'84. Lect. Notes Comput. Sci. 166, 14–25 (1984)
Berstel, J.: Complémentaires de mots infinis. Séminaire du vendredi du LITP, Paris, December 1986
Berstel, J.: Every iterated morphism yields a Co-CFL, Inf. Process. Lett. 22, 7–9 (1986)
Blanc, G., Bleuzen-Guernalec, N.: Production en temps réel et complexité de structure de suites infinies. Theor. Inf. Appl. 23, 195–216 (1989) (To appear)
Boasson, L., Nivat, M.: Adherences of languages. J. Comput. Syst. Sci. 20, 285–309 (1980)
Eilenberg, S.: Automata, languages and machines, Vol. 1. New York: Academic Press 1987
Goldstine, J.: Substitution and bounded languages. J. Comput. Syst. Sci. 67, 186–192 (1972)
Grazon, A.: An infinite word language which is not co-CFL. Inf. Process. Lett. 24, 81–85 (1987)
Kolakovski, W.: Self generating runs, problem 5304. Amer. Math. Monthly 72, 674 (1965). Solution of N. Ucoluk (same journal) 73, 681–682 (1966)
Main, M.G.: An infinite square free Co-CFL. Inf. Process. Lett. 20, 105–107 (1985)
Main, M.G., Bucher, W., Haussler, D.: Applications of an infinite square free Co-CFL. Theor. Comput. Sci. 49, 113–119 (1987)
Minsky, M.: Computation, finite and infinite machines. Englewood Cliffs, NJ: Prentice-Hall 1967
Pansiot J.-J.: On various classes of infinite words. In: Nivat, M., Perrin, D. (eds.) Automata on Infinite Words. Lect. Notes Comput. Sci. 192, 188–197 (1984)
Pansiot, J.-J.: Decidability of periodicity for infinite words. Theor. Inf. Appl. 20, 434–446 (1986)
Terlutte, A.: Sur le centre des langages DOL. Theor. Inf. Appl. 21, 137–145 (1987)
Reedy, A., Savitch, W.J.: The Turing degree of inherent ambiguity problem for context-free languages. Theor Comput. Sci. 1, 77–91 (1975)
Rogers, H.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967
Author information
Authors and Affiliations
Additional information
This work has been supported by the “Accion Integrada Hispano Francesa, 1987, 20/10”
Rights and permissions
About this article
Cite this article
Autebert, J.M., Gabarró, J. Iterated GSMs and Co-CFL. Acta Informatica 26, 749–769 (1989). https://doi.org/10.1007/BF00289160
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289160