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.
Similar content being viewed by others
References
Deussen, P.: A decidability criterion for van Wijngaarden grammars. Acta Informatica 5, 353–375 (1975)
Savitch, W.J.: Relationship between nondeterministic and deterministic tape complexities. J. Computer System Sci. 4, 177–192 (1970)
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)
Unvericht, E.: Van Wijngaarden Grammatiken vom Typ L und Typ R. Diplomarbeit am Institut für Informatik I, Universität Karlsruhe, 1976
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289249