Complementation of Büchi automata: A survey and implementation
Independent thesis Basic level (professional degree)Student thesisAlternative title
Komplement till Büchi-automater: En översikt och implementation (Swedish)
This thesis is a survey of the field of languages over infinite sequences. There is active research going on in this field, during the last year several new results where published.
We investigate the language containment problem for infinite sequences, with focus on complementation of Büchi automata. Our main focus is on the approach with alternating automata by Kupferman&Vardi. The language containment problem has been proved to be in EXPSPACE. We identify some cases when we can avoid the exponential blow-up by taking advantage of properties of the input automaton.
Some of the algorithms we explain are also implemented in a Sicstus Prolog library.
Place, publisher, year, edition, pages
Institutionen för datavetenskap , 2004.
Datalogi, Infinite sequences, Alternating automata, Complementation, Omega-regular, Büchi automata
IdentifiersURN: urn:nbn:se:liu:diva-2192ISRN: LITH-IDA-EX--04/008--SEOAI: oai:DiVA.org:liu-2192DiVA: diva2:19522