Production complexity of some operations on context-free languages

DOI10.1007/978-3-642-31623-4_11MaRDI QIDQ3167578zbMATH OpenOpenAlexFDO

Authors Ronny Harbich, Jürgen Dassow

Publication date 2 November 2012

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31623-4_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Descriptional complexity of union and star on context-free languages
• Nonterminal complexity of some operations on context-free languages
• Descriptional complexity and operations -- two non-classical cases
• scientific article; zbMATH DE number 3850491
• On the context-free production complexity of finite languages

Cited in

(10)

• On the context-free production complexity of finite languages
• On the cover complexity of finite languages
• scientific article; zbMATH DE number 3850491 (Why is no real title available?)
• Nonterminal complexity of some operations on context-free languages
• Graph operators and its applications to context free languages
• scientific article; zbMATH DE number 3592984 (Why is no real title available?)
• scientific article; zbMATH DE number 480523 (Why is no real title available?)
• Descriptional complexity of union and star on context-free languages
• Pareto grammars
• On pumping constants and smallest grammars for context-free languages

This page was built for publication: Production complexity of some operations on context-free languages

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