Co-Büchi automaton

Known as: Co-Buchi automaton 
In automata theory, a co-Büchi automaton is a variant of Büchi automaton. The only difference is the accepting condition: a Co-Büchi automaton… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2001-2015
01220012015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2013
2013
Weakly definable languages of infinite trees are an expressive subclass of regular tree languages definable in terms of weak… (More)
Is this relevant?
2009
2009
The nonemptiness problem for nondeterministic automata on infinite words can be reduced to a sequence of reachability queries… (More)
  • figure 1
  • figure 2
Is this relevant?
2009
2009
It is well known, and easy to see, that not each nondeterministic Büchi automaton on in nite words can be simulated by a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
Computations are developed for the synthesis of a finite state machine (FSM) embedded in a known FSM such that their combined… (More)
  • figure 1
Is this relevant?
2006
2006
Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on… (More)
  • figure 3
  • figure 4
Is this relevant?
2003
2003
In this paper, we focus on solving games in recursive game graphs that can model the control flow of sequential programs with… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present an algorithm to generate Büchi automata from LTL formulae. This algorithm generates a very weak alternating co-Büchi… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?