Thesis/Dissertation: David Dokoupil, učo 514619: Simple Complementation of Generalized Büchi Automata
Bachelor's thesis
Simple Complementation of Generalized Büchi Automata
Abstract
Hlavným predmetom tejto práce je rožšírenie existujúcej komplementačnej konštrukcie pre Büchiho automaty s akceptáciou na hranách. Prezentované rožšírenie sa nazýva Simple and General, alebo SaG skrátene. Rožširenie je založené na transformácií pôvodnej konštrukcie s účelom komplementovať Büchiho automaty s akceptáciou na hranách. Následne, je transformácia upravená aby umožnila komplementáciu generalizovaných …more
Abstract
The main focus of this thesis is an extension of an existing complementation construction for state-based Büchi automata. The presented extension is called Simple and General, or SaG for short. The extension is based on transforming the original construction to work with transition-based Büchi automata. The transformation is then modified further to allow the complementation of transition-based generalized …more
Thesis description
19/5/2023 17:58, prof. RNDr. Jan Strejček, Ph.D., UČO 3366
Attachments
Theses on a related topic
List of theses with an identical keyword.
-
Efficient Complementation of Generalized Büchi Automata
Mgr. David Dokoupil, UČO 514619 -
Simulation-Based Reduction of Modal Omega-Automata
Mgr. Dávid Smolka, UČO 514178 -
Simplification of Acceptance Condition of Emerson-Lei Automata
Mgr. Tereza Šťastná -
Complementation of Semi-Deterministic Transition-Based Generalized Büchi Automata
Mgr. Adam Fiedler -
Translation of an LTL fragment to deterministic Rabin and Streett automata
RNDr. František Blahoudek, Ph.D. -
Translation of LTL into nondeterministic automata with generic acceptance condition
RNDr. Juraj Major, UČO 396325 -
Tight Omega-Automata
Mgr. Marek Jankola -
Complementation of TBA Based on Semi-Determinization
Mgr. Mikuláš Klokočka




