Van wijngaarden grammars and space complexity class EXSPACE
暂无分享,去创建一个
SummaryTop-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.
[1] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[2] Peter Deussen,et al. A decidability criterion for van Wijngaarden grammars , 1975, Acta Informatica.