Selected publications by Stefan Schwoon

Streett automata are automata on infinite words. They differ from other formalisms in their acceptance condition which models strong fairness constraints. Again, their expressiveness is equal to that of Büchi automata; however, Streett automata can have an exponentially more succinct representation for certain properties. Here, we survey results about upper and lower bounds on the problems of determinization and complementation of Streett automata.

   author = {Schwoon, Stefan},
   booktitle = {{A}utomata, {L}ogics, and {I}nfinite {G}ame: {A}~{G}uide to {C}urrent {R}esearch},
   editor = {Gr{\"a}del, Erich and Thomas, Wolfgang and Wilke, Thomas},
   pages = {79-91},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science},
   title = {Determinization and Complementation of {S}treett Automata},
   volume = {2500},
   year = {2002},

About LSV