The tape-complexity of context-independent developmental languages

Authors:
Jan Van Leeuwen
Affiliations:
Department of Computer Science, State University of New York at Buffalo, Amherst, New York 14226, USA and Department of Mathematics, University of Utrecht, Utrecht, Netherlands
Venue:
Journal of Computer and System Sciences
Year:
1975

Citing 6
Cited 0

Developmental Systems and Languages

Developmental Systems and Languages
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Path systems and language recognition

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Formal languages and their relation to automata

Formal languages and their relation to automata
Memory bounds for recognition of context-free and context-sensitive languages

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that languages in the least full AFL enclosing all E0L-languages are of tape-complexity (log n)^3. The proof indicates in what respect context-independent developmental languages are ''more complex'' than context-free languages, for which a tape-complexity (log n)^2 is known.