Abstract
We solve an old conjecture of Autebert et al. [1] saying that there does not exist any minimal full trio with respect to bounded context-free languages.
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
Autebert, J.-M., Beauquier, J., Boasson, L., Latteux, M.: Very small families of algebraic nonrational languages. In: Formal Language Theory, Perspectives and Open Problems, pp. 89–107. Academic Press, Orland (1980)
Salmi, T.: Very Small Families Generated by Bounded and Unbounded Context-Free Languages. PhD thesis, University of Oulu, Department of Mathematical Sciences (2009)
Autebert, J.M., Beauquier, J., Boasson, L., Nivat, M.: Quelques problèmes ouverts en théorie des langages algébriques. RAIRO Informatique Theorique/Theoretical Informatics 13(4), 363–378 (1979)
Berstel, J., Boasson, L.: Une suite décroissante de cônes rationnels. In: Proceedings of the 2nd Colloquium on Automata, Languages and Programming, pp. 383–397. Springer, London (1974)
Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, Inc., New York (1966)
Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. Elsevier Science Inc., New York (1975)
Eilenberg, S., Schützenberger, M.P.: Rational sets in commutative monoids. Journal of Algebra 13, 173–191 (1969)
Ito, R.: Every semilinear set is a finite union of disjoint linear sets. Journal of Computer and System Sciences 3(2), 221–231 (1969)
Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart (1979)
Goldstine, J.: Substitution and bounded languages. Journal of Computer and System Sciences 6(1), 9–29 (1972)
Kortelainen, J.: Every commutative quasirational language is regular. In: Proceedings of the 12th Colloquium on Automata, Languages and Programming, pp. 348–355. Springer, London (1985)
Blattner, M., Latteux, M.: Parikh-bounded languages. In: Proceedings of the 9th Colloquium on Automata, Languages and Programming, pp. 316–323. Springer, London (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kortelainen, J., Salmi, T. (2011). There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-22321-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22320-4
Online ISBN: 978-3-642-22321-1
eBook Packages: Computer ScienceComputer Science (R0)