QBF-Based Simplification of Acceptance Condition of Emerson-Lei Automata – Bc. Tereza Schwarzová
Bc. Tereza Schwarzová
Bachelor's thesis
QBF-Based Simplification of Acceptance Condition of Emerson-Lei Automata
QBF-Based Simplification of Acceptance Condition of Emerson-Lei Automata
Abstract:
Tato práce se zabývá zjednodušováním akceptační podmínky deterministických Emerson-Lei automatů s akceptací na hranách (TELA). Představujeme čtyři úrovně zjednodušení, kde každá úroveň koresponduje s mírou zjednodušení. Tato práce zahrnuje experimentální implementaci navržené metody a vyhodnocení výsledků.Abstract:
The thesis focuses on the simplification of the acceptance condition of deterministic transition-based Emerson-Lei automata (TELA). In this thesis, we present four levels of simplification where each level corresponds to a certain degree of simplification. An implementation of the proposed procedure is included and experimentally evaluated in the thesis.
Language used: English
Date on which the thesis was submitted / produced: 25. 5. 2021
Identifier:
https://is.muni.cz/th/khyn2/
Thesis defence
- Date of defence: 30. 6. 2021
- Supervisor: doc. RNDr. Jan Strejček, Ph.D.
- Reader: prof. RNDr. Ivana Černá, 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 informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Applied Informatics / Applied Informatics
Theses on a related topic
- No theses on a related topic available.