Left-derivation bounded languages

DOI10.1016/S0022-0000(74)80018-8zbMath0281.68039OpenAlexW2045930764MaRDI QIDQ1843308

S. J. Walljasper

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80018-8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Some formal results about stratificational grammars and their relevance to linguistics, Streaming algorithms for language recognition problems, Grammatical characterizations of NPDAs and VPDAs with counters, Control sets on context-free grammar forms, One way finite visit automata, Control sets on grammars using depth-first derivations, Left-derivation bounded languages

Cites Work

• Unnamed Item
• Left-derivation bounded languages
• Derivation-bounded languages
• Some problems of finite representability
• A helpful result for proving inherent ambiguity
• Studies in abstract families of languages
• Phrase structure languages, finite machines, and channel capacity