On complementing nondeterministic Büchi automata

Sankar Gurumurthy*, Orna Kupferman, Fabio Somenzi, Moshe Y. Vardi

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

42 Scopus citations

Abstract

Several optimal algorithms have been proposed for the complementation of nondeterministic Büchi word automata. Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementation construction would be of significant practical value. Recently, Kupferman and Vardi described a complementation algorithm that goes through weak alternating automata and that seems simpler than previous algorithms. We combine their algorithm with known and new minimization techniques. Our approach is based on optimizations of both the intermediate weak alternating automaton and the final nondeterministic automaton, and involves techniques of rank and height reductions, as well as direct and fair simulation.

Original languageAmerican English
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsDaniel Geist, Enrico Tronci
PublisherSpringer Verlag
Pages96-110
Number of pages15
ISBN (Print)354020363X
DOIs
StatePublished - 2003

Publication series

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

Fingerprint

Dive into the research topics of 'On complementing nondeterministic Büchi automata'. Together they form a unique fingerprint.

Cite this