Context-free languages of countable words

Z. Ésik, Szabolcs Iván

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We define context-free grammars with Büchi acceptance condition generating languages of countable words. We establish several closure properties and decidability results for the class of Büchi context-free languages generated by these grammars. We also define context-free grammars with Müller acceptance condition and show that there is a language generated by a grammar with Müller acceptance condition which is not a Büchi context-free language.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages185-199
Number of pages15
Volume5684 LNCS
DOIs
Publication statusPublished - 2009
Event6th International Colloquium on Theoretical Aspects of Computing, ICTAC 2009 - Kuala Lumpur, Malaysia
Duration: Aug 16 2009Aug 20 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5684 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Colloquium on Theoretical Aspects of Computing, ICTAC 2009
CountryMalaysia
CityKuala Lumpur
Period8/16/098/20/09

Fingerprint

Context free languages
Context free grammars
Context-free Languages
Countable
Context-free Grammar
Computability and decidability
Grammar
Closure Properties
Decidability
Language

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ésik, Z., & Iván, S. (2009). Context-free languages of countable words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5684 LNCS, pp. 185-199). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5684 LNCS). https://doi.org/10.1007/978-3-642-03466-4_12

Context-free languages of countable words. / Ésik, Z.; Iván, Szabolcs.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5684 LNCS 2009. p. 185-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5684 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ésik, Z & Iván, S 2009, Context-free languages of countable words. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5684 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5684 LNCS, pp. 185-199, 6th International Colloquium on Theoretical Aspects of Computing, ICTAC 2009, Kuala Lumpur, Malaysia, 8/16/09. https://doi.org/10.1007/978-3-642-03466-4_12
Ésik Z, Iván S. Context-free languages of countable words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5684 LNCS. 2009. p. 185-199. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-03466-4_12
Ésik, Z. ; Iván, Szabolcs. / Context-free languages of countable words. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5684 LNCS 2009. pp. 185-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ea36068f538f472ea95b2026594655ba,
title = "Context-free languages of countable words",
abstract = "We define context-free grammars with B{\"u}chi acceptance condition generating languages of countable words. We establish several closure properties and decidability results for the class of B{\"u}chi context-free languages generated by these grammars. We also define context-free grammars with M{\"u}ller acceptance condition and show that there is a language generated by a grammar with M{\"u}ller acceptance condition which is not a B{\"u}chi context-free language.",
author = "Z. {\'E}sik and Szabolcs Iv{\'a}n",
year = "2009",
doi = "10.1007/978-3-642-03466-4_12",
language = "English",
isbn = "3642034659",
volume = "5684 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "185--199",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Context-free languages of countable words

AU - Ésik, Z.

AU - Iván, Szabolcs

PY - 2009

Y1 - 2009

N2 - We define context-free grammars with Büchi acceptance condition generating languages of countable words. We establish several closure properties and decidability results for the class of Büchi context-free languages generated by these grammars. We also define context-free grammars with Müller acceptance condition and show that there is a language generated by a grammar with Müller acceptance condition which is not a Büchi context-free language.

AB - We define context-free grammars with Büchi acceptance condition generating languages of countable words. We establish several closure properties and decidability results for the class of Büchi context-free languages generated by these grammars. We also define context-free grammars with Müller acceptance condition and show that there is a language generated by a grammar with Müller acceptance condition which is not a Büchi context-free language.

UR - http://www.scopus.com/inward/record.url?scp=70349331044&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349331044&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-03466-4_12

DO - 10.1007/978-3-642-03466-4_12

M3 - Conference contribution

AN - SCOPUS:70349331044

SN - 3642034659

SN - 9783642034657

VL - 5684 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 185

EP - 199

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -