Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1999: Fundamentals of Computation Theory pp 441–450Cite as

A parallel context-free derivation hierarchy

  • Conference paper
  • First Online:

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

Abstract

We consider the number of parallel derivation steps as complexity measure for context-free languages and show that a strict and dense hierarchy is obtained between logarithmic and linear (arbitrary) tree height. We hereby improve a result of Gabarro. Furthermore we give a non-regular language with logarithmic tree height disproving a conjecture of Culik and Maurer. As a new method we use counter-representations, where the successor relation can be handled as the complement of context-free languages.

Article

This research has been partially supported by the DFG Project La 618/3-2 KOMET.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-M. Autebert, P. Flajolet, and J. Gabarró. Prefixes of infinite words and ambiguous context-free languages. Information Processing Letters, 25:211–216, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Berstel. Transductions and context-free languages. Teubner Studienbücher, Stuttgart, 1979.

    MATH  Google Scholar 

  3. L. Boasson. personal communication. 1997.

    Google Scholar 

  4. R. V. Book. Time-bounded grammars and their languages. Journal of Computer and System Sciences, 5(4):397–429, August 1971.

    Article  MATH  MathSciNet  Google Scholar 

  5. F. J. Brandenburg. On the height of syntactical graphs. In Peter Deussen, editor, Proceedings of the 5th GI-Conference on Theoretical Computer Science, volume 104 of LNCS, pages 13–21, Karlsruhe, FRG, March 1981. Springer.

    Google Scholar 

  6. K. Culik II and H.A. Maurer. On the height of derivation trees. Forschungsbericht Nr. 18, Inst. für Informationsverarbeitung TU Graz, 1978.

    Google Scholar 

  7. J. Gabarró. Pushdown space complexity and related full-AFLs. In Symposium of Theoretical Aspects of Computer Science, volume 166 of LNCS, pages 250–259, Paris, France, 11–13 April 1984. Springer.

    Google Scholar 

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

    MATH  Google Scholar 

  9. J. Goldstine. Substitution and bounded languages. Journal of Computer and System Sciences, 6(1):9–29, February 1972.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Goldstine. Bounded AFLs. Journal of Computer and System Sciences, 12(3):399–419, June 1976.

    MATH  MathSciNet  Google Scholar 

  11. A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988.

    Google Scholar 

  12. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.

    Google Scholar 

  13. Y. Igarashi. General properties of derivational complexity. Acta Inf., 8(3):267–283, 1977.

    MATH  MathSciNet  Google Scholar 

  14. T. Kasami. An efficient recognition and syntax algorithm for context-free languages. Scientific Report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford MA, 1965.

    Google Scholar 

  15. W. Kuich, H. Prodinger, and F. J. Urbanek. On the height of derivation trees. In H. A. Maurer, editor, Automata, Languages and Programming, 6th Colloquium, volume 71 of Lecture Notes in Computer Science, pages 370–384, Graz, Austria, 16–20 July 1979. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickhard Institut für Informatik, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Klaus Reinhardt

Authors
  1. Klaus Reinhardt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, “A.I.Cuza” University, 6600, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reinhardt, K. (1999). A parallel context-free derivation hierarchy. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66412-3

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation