A further note on top-down deterministic languages

DOI10.1093/COMJNL/14.4.396MaRDI QIDQ5646391zbMATH OpenOpenAlexFDO

Authors D. Wood

Publication date 1971

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/14.4.396

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(6)

• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Some remarks on the KH algorithm fors-grammars
• State complexity of the quotient operation on input-driven pushdown automata
• Homomorphisms preserving deterministic context-free languages
• A syntax-directed parser for recalcitrant grammars
• Expressive power of \(\text{LL}(k)\) Boolean grammars

This page was built for publication: A further note on top-down deterministic languages

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