Skip to main content
SpringerLink
Log in

There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages

  • Conference paper
Developments in Language Theory (DLT 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6795))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Google Scholar 

  2. Salmi, T.: Very Small Families Generated by Bounded and Unbounded Context-Free Languages. PhD thesis, University of Oulu, Department of Mathematical Sciences (2009)

    Google Scholar 

  3. 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)

    Article  MATH  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, Inc., New York (1966)

    MATH  Google Scholar 

  6. Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. Elsevier Science Inc., New York (1975)

    MATH  Google Scholar 

  7. Eilenberg, S., Schützenberger, M.P.: Rational sets in commutative monoids. Journal of Algebra 13, 173–191 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ito, R.: Every semilinear set is a finite union of disjoint linear sets. Journal of Computer and System Sciences 3(2), 221–231 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  9. Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart (1979)

    Book  MATH  Google Scholar 

  10. Goldstine, J.: Substitution and bounded languages. Journal of Computer and System Sciences 6(1), 9–29 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Blattner, M., Latteux, M.: Parikh-bounded languages. In: Proceedings of the 9th Colloquium on Automata, Languages and Programming, pp. 316–323. Springer, London (1981)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Processing Science, University of Oulu, Finland

    Juha Kortelainen

  2. Elektrobit Corporation, Oulu

    Tuukka Salmi

Authors
  1. Juha Kortelainen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tuukka Salmi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy

    Giancarlo Mauri  & Alberto Leporati  & 

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation