On the Density of Regular and Context-Free Languages

DOI10.1007/978-3-642-14031-0_35zbMATH Open1286.68283OpenAlexW2059421791MaRDI QIDQ3578331

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

zbMATH Keywords

densitycontext-free languagesregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Estimating the Size of Context-Free Tiling Languages ⋮ THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ On the density of certain languages with \(p^2\) letters

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)