Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,272,476 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
(opens in a new tab)
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.
2019
2019
ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata
Juraj Major
,
František Blahoudek
,
J. Strejček
,
Miriama Sasaráková
,
Tatiana Zbončáková
Automated Technology for Verification and…
2019
Corpus ID: 199427568
The paper presents a new tool ltl3tela translating LTL to deterministic or nondeterministic transition-based Emerson-Lei automata…
Expand
2017
2017
Parity objectives in countable MDPs
S. Kiefer
,
Richard Mayr
,
M. Shirmohammadi
,
D. Wojtczak
Logic in Computer Science
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
2017
2017
Explorer Parity Objectives in Countable MDPs
S. Kiefer
,
Richard Mayr
,
M. Shirmohammadi
,
D. Wojtczak
2017
Corpus ID: 8499550
We study countably infinite MDPs with parity objectives, and special cases with a bounded number of colors in the Mostowski…
Expand
2015
2015
Pure Strategies in Imperfect Information Stochastic Games
Arnaud Carayol
,
Christof Löding
,
O. Serre
Fundamenta Informaticae
2015
Corpus ID: 4409071
We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We…
Expand
Highly Cited
2014
Highly Cited
2014
From LTL to Deterministic Automata: A Safraless Compositional Approach
J. Esparza
,
Jan Křetínský
International Conference on Computer Aided…
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
Automated Technology for Verification and…
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
Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata
S. Schewe
arXiv.org
2010
Corpus ID: 15988638
In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite…
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
Annual Conference for Computer Science Logic
2002
Corpus ID: 17074525
Behavioral properties of open systems can be formalized as objectives in two-player games. Turn-based games model asynchronous…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE