Left-derivation bounded languages

DOI10.1016/S0022-0000(74)80018-8MaRDI QIDQ1843308zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• A helpful result for proving inherent ambiguity
• Derivation-bounded languages
• Left-derivation bounded languages
• Phrase structure languages, finite machines, and channel capacity
• Some problems of finite representability
• Studies in abstract families of languages

Cited in

(7)

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

This page was built for publication: Left-derivation bounded languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1843308)