Transformation of Parity Automata into Büchi-Automata

This thesis is about the transformation of alternating parity automata with a maximum
of three parities into non-deterministic Büchi-automata. For this purpose, several possible trans-
formations are presented and the selected transformation is described more accurately. A program
is written in Java and described, to perform this transformation automatically.

This thesis is written in German language.