English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Van Wijngaarden Grammars and Space Complexity Class EXSPACE

MPS-Authors

Deussen,  Peter
Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Deussen, P., & Mehlhorn, K. (1977). Van Wijngaarden Grammars and Space Complexity Class EXSPACE. Acta Informatica, 8, 193-199.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AFAE-B
Abstract
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.