Context-free languages of countable words

Zoltán É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 publicationTheoretical Aspects of Computing - ICTAC 2009 - 6th International Colloquium, Proceedings
Pages185-199
Number of pages15
DOIs
Publication statusPublished - Sep 28 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)0302-9743
ISSN (Electronic)1611-3349

Other

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Context-free languages of countable words'. Together they form a unique fingerprint.

  • Cite this

    Ésik, Z., & Iván, S. (2009). Context-free languages of countable words. In Theoretical Aspects of Computing - ICTAC 2009 - 6th International Colloquium, Proceedings (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