Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Ω-automaton

Known as: Streett automaton, Rabin automaton, Omega automata 
In automata theory, a branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of finite automaton that runs on… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
We present Spot 2.0, a C++ library with Python bindings and an assortment of command-line tools designed to manipulate LTL and… Expand
  • figure 1
  • figure 2
Is this relevant?
2016
2016
We present Spot 2.0, a C++ library with Python bindings and an assortment of command-line tools designed to manipulate LTL and… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all choices are resolved by… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Owing to their unusual properties, carbon nanostructures such as nanotubes and fullerenes have caused many new nanomechanical… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
 
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Abstract In this paper, the present state of the large-eddy simulation (LES) technique is discussed. Modeling and numerical… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
This paper shows how a general technique, called {\it lock-step search}, developed for dynamic graph algorithms, can be used to… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Because of the difficulty of adequately simulating large digital designs, there has been a recent surge of interest in formal… Expand
  • figure 2.7
Is this relevant?
1992
1992
Beginning with the fundamental article of Chandra et al. [2], the notation of alternation has clarified several results… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1985
Highly Cited
1985
We describe novel techniques for establishing improved upper and lower bounds for modal logics of programs: 1) We introduce… Expand
Is this relevant?