Skip to main content
SpringerLink
Log in

On a deterministic subclass of context-free languages

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

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

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. Wechsung, G., Kompliziertheitstheoretische Charakterisierung der kontextfreien und linearen Sprachen. EIK 12 (1976) 6, 289–300.

    Google Scholar 

  2. Peckel, J., A Deterministic Subclass of Context-Free Languages, in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, 118 00, Prague, Czechoslovakia

    Jan Peckel

Authors
  1. Jan Peckel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peckel, J. (1977). On a deterministic subclass of context-free languages. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_164

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_164

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation