## Relationship between Alternating omega-Automata and Symbolically Represented Nondeterministic omega-Automata

• There is a well known relationship between alternating automata on finite words and symbolically represented nondeterministic automata on finite words. This relationship is of practical relevance because it allows to combine the advantages of alternating and symbolically represented nondeterministic automata on finite words. However, for infinite words the situation is unclear. Therefore, this work investigates the relationship between alternating omega-automata and symbolically represented nondeterministic omega-automata. Thereby, we identify classes of alternating omega-automata that are as expressive as safety, liveness and deterministic prefix automata, respectively. Moreover, some very simple symbolic nondeterminisation procedures are developed for the classes corresponding to safety and liveness properties.

### Weitere Dienste

Verfasserangaben: Thomas Tuerk, Klaus Schneider urn:nbn:de:hbz:386-kluedo-13975 Interner Bericht des Fachbereich Informatik (340) Bericht Englisch 2005 2005 Technische Universität Kaiserslautern 17.11.2005 Fachbereich Informatik F. Theory of Computation / F.1 COMPUTATION BY ABSTRACT DEVICES / F.1.2 Modes of Computation 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$