Undecidable problems concerning densities of languages

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 relati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics and theoretical computer science Jg. DMTCS Proceedings vol. AF,...; H. Proceedings; S. 69 - 76
1. Verfasser: Kozik, Jakub
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: DMTCS 01.01.2005
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Schriftenreihe:DMTCS Proceedings
Schlagworte:
[info.info-lo] computer science [cs]/logic in computer science [cs.lo]
[info.info-sc] computer science [cs]/symbolic computation [cs.sc]
asymptotic density
Computer Science
context-free languages
decidability
Logic in Computer Science
Symbolic Computation
decidability
context-free languages
asymptotic density
ISSN:1365-8050, 1462-7264, 1365-8050
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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} )$.
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.3471