Skip to main content
SpringerLink
Log in
Book cover

International Meeting of Young Computer Scientists

IMYCS 1988: Machines, Languages, and Complexity pp 55–63Cite as

A remark on some classifications of Indian parallel languages

  • Chapter 1 Languages
  • Conference paper
  • First Online:

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

Abstract

We discuss the descriptional complexity measures number of nonterminals, number of productions, and number of symbols of Indian parallel grammars and Indian parallel languages.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. J. Gruska, On a classifikation of context-free languages, Kybernetika 3 (1967) 22–29.

    Google Scholar 

  3. J. Gruska, Some classifications of context-free languages, Information and Control 14 (1969) 152–179.

    Google Scholar 

  4. J. Gruska, Complexity and unambiguity of context-free grammars and languages, Information and Control 18 (1971) 502–512.

    Google Scholar 

  5. J. Gruska, On the size of context-free grammars, Kybernetika 8 (1972) 213–218.

    Google Scholar 

  6. J. Gruska, Descriptional complexity of context-free languages, in: Proc. MFCS'73 High Tatras (1973) 71–83.

    Google Scholar 

  7. M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley P.C., Reading Massachusetts, 1978)

    Google Scholar 

  8. B. Reichel, Some classifications of Indian parallel languages, submitted for publication.

    Google Scholar 

  9. R. Siromoney and K. Krithivasan, Parallel context-free languages, Information and Control 24 (1974) 155–162.

    Google Scholar 

  10. S. Skyum, Parallel context-free languages, Information and Control 26 (1974) 280–285.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Technological University, P.O. Box 124, DDR - 3010, Magdeburg, German Democratic Republic

    Bernd Reichel

Authors
  1. Bernd Reichel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Dassow J. Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reichel, B. (1989). A remark on some classifications of Indian parallel languages. In: Dassow, J., Kelemen, J. (eds) Machines, Languages, and Complexity. IMYCS 1988. Lecture Notes in Computer Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015927

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51516-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation