Skip to main content
SpringerLink
Log in

Ogden’s Lemma for ET0L Languages

  • Conference paper
Language and Automata Theory and Applications (LATA 2012)

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

Abstract

We develop a necessary condition for ET0L languages inspired by Ogden’s Lemma. Besides being useful for proving that individual languages are not ET0L languages, this result also gives an alternative proof of Ehrenfeucht and Rozenberg’s theorem about rare and nonfrequent symbols in ET0L 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. Beauquier, J.: Deux familles de langages incomparables. Information and Control 43(2), 101–122 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1989)

    Book  MATH  Google Scholar 

  3. Ehrenfeucht, A., Rozenberg, G.: A pumping theorem for EDT0L languages. Tech. Rep. CU-CS-047-74, University of Colorado (1974)

    Google Scholar 

  4. Ehrenfeucht, A., Rozenberg, G.: On proving that certain languages are not ETOL. Acta Informatica 6, 407–415 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ewert, S., van der Walt, A.: A pumping lemma for random permitting context languages. Theoretical Computer Science 270(1-2), 959–967 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ogden, W.: A helpful result for proving inherent ambiguity. Mathematical Systems Theory 2, 191–194 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  7. Păun, G.: Some further remarks on the family of finite index matrix languages. RAIRO Informatique Théorique 13(3), 289–297 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  8. Rozenberg, G.: More on ET0L systems versus random context grammars. Information Processing Letters 5(4), 102–106 (1976)

    Article  MATH  Google Scholar 

  9. van der Walt, A., Ewert, S.: A shrinking lemma for random forbidding context languages. Theoretical Computer Science 237(1-2), 149–158 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of the Witwatersrand, Johannesburg, South Africa

    Max Rabkin

Authors
  1. Max Rabkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rabkin, M. (2012). Ogden’s Lemma for ET0L Languages. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28332-1_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28331-4

  • Online ISBN: 978-3-642-28332-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation