On the context-free production complexity of finite languages

DOI10.1016/S0166-218X(87)80004-5zbMath0636.68098MaRDI QIDQ1098318

Zsolt Tuza

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

finite languagecontext-free productions

Mathematics Subject Classification ID

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

Related Items (2)

On the compressibility of finite languages and formal proofs ⋮ On the cover complexity of finite languages

Cites Work

• Unnamed Item
• Context-free complexity of finite languages
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• A lower-bound for the number of productions required for a certain class of languages
• Concise description of finite languages

This page was built for publication: On the context-free production complexity of finite languages