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

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- Paul Hunter, Anuj Dawar
- 2008

We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and… (More)

Is this relevant?

2006

2006

- Manfred Droste, George Rahonis
- Developments in Language Theory
- 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

- Paul Hunter, Anuj Dawar
- MFCS
- 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

- Roman R. Redziejowski
- Fundam. Inform.
- 2004

A finite-state model of communicating processes is presented alongside with the Muller-Bartky model of asynchronous circuits. The… (More)

Is this relevant?

2000

1997

Highly Cited

1994

Highly Cited

1994

- Rajeev Alur, David L. Dill
- Theor. Comput. Sci.
- 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)

Is this relevant?

1992

1992

- Rana Barua
- Theor. Comput. Sci.
- 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

- Didier Caucal
- CAAP
- 1990

We consider a pushdown automaton as a word-rewriting system with labelled rules applied only in a prefix way. The notion of… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Shmuel Safra
- FOCS
- 1988

Automata on infinite words were introduced by Biichi in order to give a decision procedure for SlS, the monadic second-order… (More)

Is this relevant?