Complexity and minimality of context-free grammars and languages

DOI10.1007/3-540-08353-7_144MaRDI QIDQ4135014zbMATH OpenOpenAlexFDO

Authors Anton Černý

Publication date 1977

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-08353-7_144

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• On the cover complexity of finite languages

This page was built for publication: Complexity and minimality of context-free grammars and languages

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