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

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings vol. AF,...; číslo Proceedings; s. 69 - 76
Hlavný autor:	Kozik, Jakub
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	DMTCS 01.01.2005 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Edícia:	DMTCS Proceedings
Predmet:	[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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!