This thesis elaborates the Büchi automata theory and introduces a library that enables working with them. Basics of the automata theory is explained. The main part of this work is focused on Büchi automata, which belong to finite automata. The main properties of Büchi automata are explained and proved. The knowledge of those properties is important for understanding the algorithms mentioned in this work. The next part describes those algorithms and explains their principles in details. The design of library is described in the next part of this work. Main part is aimed at the implementation of the library and auxiliary scripts. The most interesting and important parts of methods are described in detail. Closing part describes testing of library functionality.
Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:236156 |
Date | January 2013 |
Creators | Schindler, Petr |
Contributors | Lengál, Ondřej, Rogalewicz, Adam |
Publisher | Vysoké učení technické v Brně. Fakulta informačních technologií |
Source Sets | Czech ETDs |
Language | Czech |
Detected Language | English |
Type | info:eu-repo/semantics/masterThesis |
Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0015 seconds