Skip to main content
SpringerLink
Log in

Conditions enforcing regularity of context-free languages

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1982)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 140))

Included in the following conference series:

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. J.M. Autebert, J. Beauquier, L. Boasson and M. Latteux, Very small families of algebraic nonrational languages, in R. Book (ed.), Formal language theory; perspectives and open problems, 1980, Academic Press, London, New York, 89–108.

    Chapter  Google Scholar 

  2. J.M. Autebert, J. Beauquier, L. Boasson and M. Nivat, Quelques problèmes ouverts en théorie des languages algébriques, 1979, RAIRO Informatique Theorique, v. 13, 363–379.

    Article  MathSciNet  Google Scholar 

  3. D.R. Bean, A. Ehrenfeucht and G.F. McNulty, Avoidable patterns in strings of symbols, 1979, Pacific Journal of Mathematics, v. 85, n.2, 261–293.

    Article  MathSciNet  Google Scholar 

  4. J. Berstel, Sur les mots sans carré definis par un morphisme, 1979, Springer Lecture Notes in Computer Science, v. 71, 16–25.

    Article  Google Scholar 

  5. L. Boasson, Un critére de rationnalité des languages algébriques, in M. Nivat (ed.), Automata, Languages and Programming, 1973, North-Holland, Amsterdam, 359–365.

    Google Scholar 

  6. L. Boasson, private communication.

    Google Scholar 

  7. A. Ehrenfeucht and G. Rozenberg, On the separating power of EOL systems, RAIRO Informatique Theorique, to appear.

    Google Scholar 

  8. M. Harrison, Introduction to formal language theory, 1978, Addison-Wesley, Reading, Massachusetts.

    MATH  Google Scholar 

  9. G.H. Higman, Ordering by divisibility in abstract algebras, 1952, Proc. London Math. Society, v.3, 326–336.

    Article  MathSciNet  Google Scholar 

  10. M. Latteux, Ph.D. thesis, 1979, University of Lille.

    Google Scholar 

  11. M. Latteux, CÔnes rationnels commutatifs, 1979, Journal of Computer and Systems Science, v. 18, 307–333.

    Article  Google Scholar 

  12. M. Latteux, private communication.

    Google Scholar 

  13. C.St.J.A. Nash-Williams, A survey of the theory of well-quasi-ordered sets, in Combinatorial Structures and Their Applications, 1970, Gordon and Breach, New York, London, 293–300.

    Google Scholar 

  14. R. Ross and K. Winklman, Repetitive strings are not context-free, RAIRO Informatique Theorique, to appear.

    Google Scholar 

  15. A. Salomaa, Jewels of formal language theory, 1981, Computer Science Press, Rockville, Maryland.

    MATH  Google Scholar 

  16. A. Thue, Uber unendliche Zeichenreihen, 1906, Norske Vid. Selsk.Skr., I Mat. Nat. Kl., Christiania, v. 7, 1–22.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Colorado at Boulder, 80309, Boulder, Colorado, USA

    A. Ehrenfeucht & D. Haussler

  2. Institute of Applied Mathematics and Computer Science, University of Leiden, Wassenaarseweg 80, 2333, AL Leiden, The Netherlands

    G. Rozenberg

Authors
  1. A. Ehrenfeucht
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Haussler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrenfeucht, A., Haussler, D., Rozenberg, G. (1982). Conditions enforcing regularity of context-free languages. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012768

Download citation

  • DOI: https://doi.org/10.1007/BFb0012768

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation