scientific article; zbMATH DE number 3850491

MaRDI QIDQ3319787zbMATHFDO

Authors Anton Černý

Publication date 1983

Full work available at URL https://eudml.org/doc/28070

zbMATH Keywords

context-free languagesdecision problemssyntactic complexityinfinite hierarchies

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Two complexity measures for context-free languages
• Descriptional complexity of union and star on context-free languages
• scientific article; zbMATH DE number 4039331
• Production complexity of some operations on context-free languages
• Descriptional complexity of context-free grammar forms

Cites work

• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Complexity and unambiguity of context-free grammars and languages
• Some classifications of context-free languages

Cited in

(14)

• Production complexity of some operations on context-free languages
• A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS
• Descriptional complexity of context-free grammar forms
• scientific article; zbMATH DE number 3917734 (Why is no real title available?)
• scientific article; zbMATH DE number 4039331 (Why is no real title available?)
• A tree-height hierarchy of context-free languages
• Derivational complexity of context-free grammars
• scientific article; zbMATH DE number 428239 (Why is no real title available?)
• Descriptional complexity of union and star on context-free languages
• Two complexity measures for context-free languages
• scientific article; zbMATH DE number 4028929 (Why is no real title available?)
• On the degrees of non-regularity and non-context-freeness
• scientific article; zbMATH DE number 910357 (Why is no real title available?)
• The Cantor-Bendixson analysis of finite trees

This page was built for publication:

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