ON THE DENSITY OF REGULAR AND CONTEXT-FREE LANGUAGES

DOI10.1142/S179383091000084XzbMath1211.68208OpenAlexW1990749667MaRDI QIDQ3084684

Michael Hartwig

Publication date: 25 March 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383091000084x

zbMATH Keywords

densitycontext-free languagesregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Analytic models and ambiguity of context-free languages
• On universally easy classes for NP-complete problems.
• Finite state languages
• The growth function of context-free languages

This page was built for publication: ON THE DENSITY OF REGULAR AND CONTEXT-FREE LANGUAGES