Skip to main content
SpringerLink
Log in

A stronger version of parikh theorem

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

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

  • 757 Accesses

Abstract

In the present paper we study the semilinear property of languages approximated by sequences of context-free grammars introduced in [Chy I]. It is shown that each language approximated by a sequence converging with a rate f ε o(log[5]) which is a nondecreasing function is a slip language. In other words, the well-known Parikh theorem holds even for classes wider then the class of context-free languages. In addition the AFL-properties of these languages and some special cases of approximations by context-free languages are also studied to show that in the case of approximations by bounded context-free languages there exists a gap.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.P. Chytil, Kins of CFL, Proceeding of MFCS'86, Lecture Notes in CS vol.233 Springer-Verlag

    Google Scholar 

  2. M.P. Chytil, Almost Context Free Languages, Fundamenta Informaticae IX(1986), 283–322 North-Holland.

    Google Scholar 

  3. M. Chytil, Limity posloupností CF gramatik, Praha 1987.

    Google Scholar 

  4. F.J.Brandenburg On one-way auxiliary pushdown automata Proc. of 3rd GI conf. Theor. Comp. Sci. LNCS 48, 1977.

    Google Scholar 

  5. S.Ginsburg, The mathematical theory of context-free languages. McGraw Hill 1966.

    Google Scholar 

  6. A.Salomaa, Formal languages, Academic Press 1973

    Google Scholar 

  7. M.P.Chytil — M.Platek — J. Vogel A note on the Chomsky hierarchy, The Bulletin of the EATCS 27, 1985.

    Google Scholar 

  8. Semilinear structure of a-languages. TR No.56/1989 Depart. Comp. Sci., Charles University Prague.

    Google Scholar 

  9. Ogden W. — Ross R. — Winklmann An “Interchange lemma” for context-free languages, SIAM J. comp. Vol 15 No2 5/1985.po

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Charles University Prague, Malostranske Nam. 25, 11800, Praha 1

    Pham Huu Uyen

Authors
  1. Pham Huu Uyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uyen, P.H. (1990). A stronger version of parikh theorem. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029646

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation