Theory and Applications of Models of Computation

DOI10.1007/11750321MaRDI QIDQ5898909zbMATH OpenOpenAlexFDO

Authors Haiming Chen, Yunmei Dong

Publication date 30 April 2007

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

Full work available at URL https://doi.org/10.1007/11750321

zbMATH Keywords

computabilitycontext-free languageoperatorrecursive functionstructured data

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1692936
• Formalization of the pumping lemma for context-free languages
• The complexity of computing the number of strings of given length in context-free languages
• Some applications of the formalization of the pumping lemma for context-free languages
• Recursive functions of context free languages

Cited in

(4)

• A note on the class of languages generated by F-systems over regular languages
• scientific article; zbMATH DE number 1692936 (Why is no real title available?)
• A mechanisation of some context-free language theory in HOL4
• Certified context-free parsing: a formalisation of Valiant's algorithm in Agda

This page was built for publication: Theory and Applications of Models of Computation

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