Size complexity in context-free grammars forms

DOI10.1145/321978.321980MaRDI QIDQ4099227zbMATH OpenOpenAlexFDO

Authors Seymour Ginsburg, Nancy Lynch

Publication date 1976

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321978.321980

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(4)

• Concise description of finite languages
• A pushdown automaton or a context-free grammar - which is more economical?
• Pushdown acceptor forms
• On pumping constants and smallest grammars for context-free languages

This page was built for publication: Size complexity in context-free grammars forms

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