Skip to search formSkip to main contentSkip to account menu

Ω-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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with… 
2017
2017
The Rabin and Streett acceptance conditions are dual. Accordingly, deterministic Rabin and Streett automata are dual. Yet, when… 
2010
2010
In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite… 
2009
2009
  • C. Fox
  • 2009
  • Corpus ID: 191695623
title inscribed in pencil on verso. inscribed in pencil on verso: c. fox photo 20 melbourne streett geelong west victoria. 
Review
2003
Review
2003
The synergistic use of experiments and numerical simulations can uncover the underlying physics of airframe noise sources. We… 
Review
2003
Review
2003
The hierarchy of properties as overviewed by Manna and Pnueli [23] relates language, topology, ω-automata, and linear temporal… 
2000
2000
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce… 
1991
1991
Church's problem and the emptiness problem for Rabin automata on infinite trees, which represent basic paradigms for program…