Left-derivation bounded languages

Authors:
S. J. Walljasper
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1974

Citing 2
Cited 1

The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
Derivation-bounded languages

Journal of Computer and System Sciences

Streaming algorithms for language recognition problems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Left-derivation bounded languages are defined as those languages defined from context-free grammars by placing a bound on the number of nonterminals appearing in left-derivations. These languages are generated by left-derivation bounded grammars and form a full AFL not closed under reversal. The left-derivation bounded languages properly contain the nonterminal bounded languages and are properly contained in the derivation bounded languages.