Adam Fiedler

Bachelor's thesis

Complementation of Semi-Deterministic Transition-Based Generalized Büchi Automata

Complementation of Semi-Deterministic Transition-Based Generalized Büchi Automata
Abstract:
Práca rozširuje NCSB algoritmus na komplementáciu semi-deterministických generalizovaných Büchiho automatov s akceptáciou na hranách (SDTGBA). Podľa našich informácií je toto rozšírenie prvý algoritmus, ktorý dokáže komplementovať SDTGBA bez transformácií vstupného automatu. Dokazujeme korektnosť rozšírenia, analyzujeme jeho zložitosť a navrhujeme niekoľko optimalizácií. Prikladáme tiež implementáciu …more
Abstract:
The thesis presents an extension of the NCSB algorithm to complement the semi-deterministic transition-based generalized Büchi automaton (SDTGBA). To the best of our knowledge, this extension is the first existing algorithm that can complement the SDTGBA without transforming the input automaton. We prove the extension’s correctness, analyze its complexity, and suggest several optimizations. An implementation …more
 
 
Language used: English
Date on which the thesis was submitted / produced: 27. 5. 2019

Thesis defence

  • Date of defence: 27. 6. 2019
  • Supervisor: doc. RNDr. Jan Strejček, Ph.D.
  • Reader: prof. RNDr. Mojmír Křetínský, CSc.

Citation record

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky

Masaryk University

Faculty of Informatics

Bachelor programme / field:
Applied Informatics / Applied Informatics

Theses on a related topic

  • No theses on a related topic available.