Muller automaton

In automata theory, a Muller automaton is a type of an ω-automaton. The acceptance condition separates a Muller automaton from other ω-automata.The… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2017
02419832017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and… (More)
  • figure 2
  • figure 3
Is this relevant?
2006
2006
We introduce weighted automata over infinite words with Muller acceptance condition and we show that their behaviors coincide… (More)
Is this relevant?
2005
2005
We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and… (More)
Is this relevant?
2004
2004
A finite-state model of communicating processes is presented alongside with the Muller-Bartky model of asynchronous circuits. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
 
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
R. Barua, The Hausdorff-Kuratowski hierarchy of o-regular languages and a hierarchy of Muller automata, Theoretical Computer… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We consider a pushdown automaton as a word-rewriting system with labelled rules applied only in a prefix way. The notion of… (More)
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Automata on infinite words were introduced by Biichi in order to give a decision procedure for SlS, the monadic second-order… (More)
  • figure 1
Is this relevant?