The quest for a tight translation of Büchi to co-Büchi automata

Udi Boker*, Orna Kupferman

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The Büchi acceptance condition specifies a set α of states, and a run is accepting if it visits α infinitely often. The co-Büchi acceptance condition is dual, thus a run is accepting if it visits α only finitely often. Nondeterministic Büchi automata over words (NBWs) are strictly more expressive than nondeterministic co-Büchi automata over words (NCWs). The problem of the blow-up involved in the translation (when possible) of an NBW to an NCW has been open for several decades. Until recently, the best known upper bound was 2 O(n log n) and the best lower bound was n. We describe the quest to the tight 2Θ(n) bound.

Original languageAmerican English
Title of host publicationFields of Logic and Computation - Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday
Pages147-164
Number of pages18
DOIs
StatePublished - 2010
Event35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, and 19th EACSL Annual Conference on Computer Science Logic, CSL 2010 - Brno, Czech Republic
Duration: 22 Aug 201022 Aug 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6300 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, and 19th EACSL Annual Conference on Computer Science Logic, CSL 2010
Country/TerritoryCzech Republic
CityBrno
Period22/08/1022/08/10

Keywords

  • Büchi automata
  • automata translation
  • co-Büchi automata
  • nondeterminism

Fingerprint

Dive into the research topics of 'The quest for a tight translation of Büchi to co-Büchi automata'. Together they form a unique fingerprint.

Cite this