scientific article; zbMATH DE number 1390085

MaRDI QIDQ4934352zbMATH OpenFDO

Authors Klaus Reinhardt

Publication date 17 January 2000

zbMATH Keywords

context-free languagescomplexity measure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A tree-height hierarchy of context-free languages
• scientific article; zbMATH DE number 4121469
• Publication:3200545
• Parallel recognition and ranking of context-free languages
• A pumping result for 2-context-free languages

Cited in

(6)

• A tree-height hierarchy of context-free languages
• scientific article; zbMATH DE number 1234886 (Why is no real title available?)
• scientific article; zbMATH DE number 4041318 (Why is no real title available?)
• scientific article; zbMATH DE number 4176462 (Why is no real title available?)
• A pumping result for 2-context-free languages
• On families of categorial grammars of bounded value, their learnability and related complexity questions

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 Q4934352)