A parallel context-free derivation hierarchy

DOI10.1007/3-540-48321-7_37MaRDI QIDQ4934352zbMATH OpenFDO

Authors Klaus Reinhardt

Publication date 17 January 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48321-7_37

zbMATH Keywords

complexity measurecontext-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

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

Cited in

(6)

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

This page was built for publication: A parallel context-free derivation hierarchy

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