Minimal separating sets for acceptance conditions in Muller automata

DOI10.1016/S0304-3975(99)00016-XzbMath0953.68073OpenAlexW2033795369MaRDI QIDQ1575897

Helmut Lescow, Jens Vöge

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00016-x

zbMATH Keywords

Muller automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Chains and Superchains for ω-Rational Sets, Automata and Semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Infinite games played on finite graphs
• On the synthesis of strategies in infinite games
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Minimal separating sets for acceptance conditions in Muller automata