Complexity and minimality of context-free grammars and languages

DOI10.1007/3-540-08353-7_144zbMATH Open0361.68106OpenAlexW2140622568MaRDI QIDQ4135014FDOQ4135014

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)