Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,569,551 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
4 relations
Automata theory
Büchi automaton
Weak Büchi automaton
Ω-automaton
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Parity objectives in countable MDPs
S. Kiefer
,
R. Mayr
,
M. Shirmohammadi
,
D. Wojtczak
32nd Annual ACM/IEEE Symposium on Logic in…
2017
Corpus ID: 6468126
We study countably infinite MDPs with parity objectives, and special cases with a bounded number of colors in the Mostowski…
Expand
Highly Cited
2014
Highly Cited
2014
From LTL to Deterministic Automata: A Safraless Compositional Approach
J. Esparza
,
Jan Křetínský
CAV
2014
Corpus ID: 1242952
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula i¾?. The automaton is…
Expand
2013
2013
Improved Upper and Lower Bounds for Büchi Disambiguation
Hrishikesh Karmarkar
,
Manas R. Joglekar
,
Supratik Chakraborty
ATVA
2013
Corpus ID: 11780456
We present a new ranking based construction for disambiguating non-deterministic Buchi automata and show that the state…
Expand
2010
2010
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
S. Schewe
FSTTCS
2010
Corpus ID: 16016540
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite…
Expand
2010
2010
Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata
S. Schewe
ArXiv
2010
Corpus ID: 15988638
In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite…
Expand
Highly Cited
2009
Highly Cited
2009
Qualitative Determinacy and Decidability of Stochastic Games with Signals
N. Bertrand
,
B. Genest
,
H. Gimbert
24th Annual IEEE Symposium on Logic In Computer…
2009
Corpus ID: 10250498
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of…
Expand
2006
2006
Sequential Synthesis with Co-Büchi Specifications
Guoqiang Wang
,
A. Mishchenko
,
R. Brayton
,
A. Sangiovanni-Vincentelli
2006
Corpus ID: 16230321
Computations are developed for the synthesis of a finite state machine (FSM) embedded in a known FSM such that their combined…
Expand
2005
2005
Synthesizing FSMs According to Co-Büchi Properties
Guoqiang Wang
,
A. Mishchenko
,
R. Brayton
,
A. Sangiovanni-Vincentelli
2005
Corpus ID: 16959348
Computations are developed for the synthesis of an FSM embedded in a known larger system such that the overall behavior satisfies…
Expand
2002
2002
Trading Probability for Fairness
M. Jurdzinski
,
O. Kupferman
,
T. Henzinger
CSL
2002
Corpus ID: 17074525
Behavioral properties of open systems can be formalized as objectives in two-player games. Turn-based games model asynchronous…
Expand
Highly Cited
2001
Highly Cited
2001
Fast LTL to Büchi Automata Translation
P. Gastin
,
Denis Oddoux
CAV
2001
Corpus ID: 37171124
We present an algorithm to generate Buchi automata from LTL formulae. This algorithm generates a very weak alternating co-Buchi…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE