Abstract
We prove that ETOL languages of finite index are Parikh-bounded. Namely, every ETOL language of finite index contains a letter-equivalent bounded sublanguage.
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.
Similar content being viewed by others
References
J. Beauquier, “Dmx familles de, langages incomparables ”. information and Control 43 (1979), pp. 101–122.
M. Blattner and M. Latteux, “Pahikh-bounded languages ”. 8th Icalp, Acre, 1981, Lecture Notes in Computer Sci. 115, pp. 316–323.
G.T. Herman and G. Rozenberg, “Developmental Systems and languages ”. North-Holland Publ., Amsterdam, 1975.
A.K. Joshi and T. Yokomori, “Semi-linearity, Parikh-boundedness and tree, adjunct languages ”. Information Processing Letters 17 (1983), pp. 137–143.
M. Latteux, “Substitutions dans les Edtol systèrnes ultralinéaires ”. information and Control 42 (1979), pp. 194–260.
M. Latteux and J. Leguy, “Une. propriété de, la famille. GRE ”. FCT’79, Berlin, 1979, Akademie-Verlag, pp. 255–261.
E. Makinen, “On context-free and Szilard languages ”. BIT 24 (1984), pp. 164–170.
G. Paun, “On the. family of finite, Index matrix languages ”. J. Comput. System Sci. 18 (1979), pp. 267–280.
G. Paun, “On Parikh-boundedness of matrix languages ”. Bulletin of Eatcs 25 (1985), pp. 34–37.
V. Rajlich, “Absolutely parallel grammars and two-way finite. state transducers ”. J. Comput. System Sci. 6 (1972), pp. 324–342.
A. Restivo and C. Reutenauer, “Some, applications of a tkeorem of Shirshov to language theory ”. Information and Control 57 (1983), pp. 205–213.
A. Restivo and C. Reutenauer. “Cancellation, pumping and permutation In formal languages ”. 11th Icalp, Antwerp, 1984, Lecture Notes in Computer Sci. 172, pp. 414–422.
G. Rozenberg and A. Salomaa, “The. Mathematical Theory of L Systems ”. Academic Press, 1980.
G. Rozenberg and D. Vermeir, “On ETOL Systems of finite Index ”. Information and Control 38 (1978), pp. 103–133.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Latteux, M., Terlutte, A. (1986). The Parikh-Boundedness of Etol Languages of Finite Index. In: The Book of L. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95486-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-95486-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-95488-7
Online ISBN: 978-3-642-95486-3
eBook Packages: Springer Book Archive