Skip to main content

Advertisement

Log in

Van wijngaarden grammars and space complexity class EXSPACE

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Top-down and bottom-up decision strategies for van Wijngaarden grammars led to type R and type L van Wijngaarden grammars. The corresponding language families are now shown to be equal and, furthermore, to equal EXSPACE. Thus, EXSPACE is characterised syntactically, and the closure properties of type L and type R languages are those of EXSPACE.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Deussen, P.: A decidability criterion for van Wijngaarden grammars. Acta Informatica 5, 353–375 (1975)

    Google Scholar 

  2. Savitch, W.J.: Relationship between nondeterministic and deterministic tape complexities. J. Computer System Sci. 4, 177–192 (1970)

    Google Scholar 

  3. Sintzoff, M.: Existence of a van Wijngaarden syntax for every recursively enumerable set..Annales de la Société Scientifique de Bruxelles, T. 81, II (1967)

    Google Scholar 

  4. Unvericht, E.: Van Wijngaarden Grammatiken vom Typ L und Typ R. Diplomarbeit am Institut für Informatik I, Universität Karlsruhe, 1976

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deussen, P., Mehlhorn, K. Van wijngaarden grammars and space complexity class EXSPACE. Acta Informatica 8, 193–199 (1977). https://doi.org/10.1007/BF00289249

Download citation

  • Received:

  • Issue Date:

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

Keywords