scientific article; zbMATH DE number 3850491

zbMATH Open0535.68039MaRDI QIDQ3319787FDOQ3319787

Authors: Anton Černý 

Publication date: 1983

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

context-free languagesdecision problemssyntactic complexityinfinite hierarchies

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some classifications of context-free languages
• Complexity and unambiguity of context-free grammars and languages

Cited In (13)

• A tree-height hierarchy of context-free languages
• Title not available (Why is that?)
• Production complexity of some operations on context-free languages
• A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS
• Derivational complexity of context-free grammars
• Descriptional complexity of union and star on context-free languages
• Two complexity measures for context-free languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Descriptional complexity of context-free grammar forms
• 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)