Büchi context-free languages

Z. Ésik, Szabolcs Iván

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

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

Original languageEnglish
Pages (from-to)805-821
Number of pages17
JournalTheoretical Computer Science
Volume412
Issue number8-10
DOIs
Publication statusPublished - Mar 4 2011

Fingerprint

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

Keywords

  • Buchi acceptance condition
  • Context-free languages
  • Countable words
  • Ordinals

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Büchi context-free languages. / Ésik, Z.; Iván, Szabolcs.

In: Theoretical Computer Science, Vol. 412, No. 8-10, 04.03.2011, p. 805-821.

Research output: Contribution to journalArticle

Ésik, Z. ; Iván, Szabolcs. / Büchi context-free languages. In: Theoretical Computer Science. 2011 ; Vol. 412, No. 8-10. pp. 805-821.
@article{4879bc78279349b58caa603462637d43,
title = "B{\"u}chi context-free languages",
abstract = "We define context-free grammars with Bchi acceptance condition generating languages of countable words. We establish several closure properties and decidability results for the class of Bchi context-free languages generated by these grammars. We also define context-free grammars with Mller acceptance condition and show that there is a language generated by a grammar with Mller acceptance condition which is not a Bchi context-free language.",
keywords = "Buchi acceptance condition, Context-free languages, Countable words, Ordinals",
author = "Z. {\'E}sik and Szabolcs Iv{\'a}n",
year = "2011",
month = "3",
day = "4",
doi = "10.1016/j.tcs.2010.11.026",
language = "English",
volume = "412",
pages = "805--821",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "8-10",

}

TY - JOUR

T1 - Büchi context-free languages

AU - Ésik, Z.

AU - Iván, Szabolcs

PY - 2011/3/4

Y1 - 2011/3/4

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

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

KW - Buchi acceptance condition

KW - Context-free languages

KW - Countable words

KW - Ordinals

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

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

U2 - 10.1016/j.tcs.2010.11.026

DO - 10.1016/j.tcs.2010.11.026

M3 - Article

VL - 412

SP - 805

EP - 821

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 8-10

ER -