Two complexity measures for context-free languages

DOI10.1080/00207168808803681MaRDI QIDQ3821606zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

Publication date 1988

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168808803681

zbMATH Keywords

complex measurescontext-free languagespure iterative languagesregular languagesweak identity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3850491
• scientific article; zbMATH DE number 428239
• Descriptional complexity of union and star on context-free languages
• On the degree of non-regularity of context-free languages
• scientific article; zbMATH DE number 3843141

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• On regularity of context-free languages
• Semi-discrete context-free languages^†

Cited in

(13)

• Concerning two-adjacent context-free languages
• On the context-free production complexity of finite languages
• scientific article; zbMATH DE number 428239 (Why is no real title available?)
• scientific article; zbMATH DE number 3850491 (Why is no real title available?)
• A tree-height hierarchy of context-free languages
• On the degree of non-regularity of context-free languages
• scientific article; zbMATH DE number 3917710 (Why is no real title available?)
• Asymptotical behaviour of some non-uniform measures
• scientific article; zbMATH DE number 4128421 (Why is no real title available?)
• scientific article; zbMATH DE number 910357 (Why is no real title available?)
• Cognitive and sub-regular complexity
• Immunity and pseudorandomness of context-free languages
• The effective entropies of some extensions of context-free languages

This page was built for publication: Two complexity measures for context-free languages

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