On the Density of Regular and Context-Free Languages
From MaRDI portal
Publication:3578331
DOI10.1007/978-3-642-14031-0_35zbMATH Open1286.68283OpenAlexW2059421791MaRDI QIDQ3578331FDOQ3578331
Authors: Michael Hartwig 
Publication date: 20 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_35
Recommendations
- On the density of regular and context-free languages
- On the density of regular languages
- On the density of context-free and counter languages
- On the density of context-free and counter languages
- LATIN 2004: Theoretical Informatics
- On regularity of context-free languages
- Conditional densities of regular languages
- On the degree of non-regularity of context-free languages
- scientific article; zbMATH DE number 3843141
- scientific article; zbMATH DE number 1261119
Cited In (10)
- Analytic models and ambiguity of context-free languages
- On the density of regular and context-free languages
- LATIN 2004: Theoretical Informatics
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of the counting function of sparse context-free languages.
- THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES
- On the density of certain languages with \(p^2\) letters
- Estimating the Size of Context-Free Tiling Languages
- Regular algebra applied to language problems
This page was built for publication: On the Density of Regular and Context-Free Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578331)
