HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information

# Undecidable problems concerning densities of languages

Abstract : In this paper we prove that the question whether a language presented by a context free grammar has density, is undecidable. Moreover we show that there is no algorithm which, given two unambiguous context free grammars on input, decides whether the language defined by the first grammar has a relative density in the language defined by the second one. Our techniques can be extended to show that this problem is undecidable even for languages given by grammars from $LL(k)$ (for sufficiently large fixed $k ∈ \mathbb{N} )$.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [8 references]

https://hal.inria.fr/hal-01183335
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 10:19:45 AM
Last modification on : Tuesday, December 7, 2021 - 3:33:14 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:35:42 AM

### File

dmAF0105.pdf
Publisher files allowed on an open archive

### Citation

Jakub Kozik. Undecidable problems concerning densities of languages. Computational Logic and Applications, CLA '05, 2005, Chambéry, France. pp.69-76, ⟨10.46298/dmtcs.3471⟩. ⟨hal-01183335⟩

Record views