liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Complementation of Büchi automata: A survey and implementation
Linköping University, Department of Computer and Information Science.
Linköping University, Department of Computer and Information Science.
2004 (English)Independent thesis Basic level (professional degree)Student thesisAlternative title
Komplement till Büchi-automater: En översikt och implementation (Swedish)
Abstract [en]

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.
Keyword [en]
Datalogi, Infinite sequences, Alternating automata, Complementation, Omega-regular, Büchi automata
Keyword [sv]
National Category
Computer Science
URN: urn:nbn:se:liu:diva-2192ISRN: LITH-IDA-EX--04/008--SEOAI: diva2:19522
Available from: 2004-03-10 Created: 2004-03-10

Open Access in DiVA

fulltext(903 kB)386 downloads
File information
File name FULLTEXT01.pdfFile size 903 kBChecksum MD5
Type fulltextMimetype application/pdf

By organisation
Department of Computer and Information Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 386 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 473 hits
ReferencesLink to record
Permanent link

Direct link