ω-automaty: Rabinovy automaty

Abstract

This bachelor's thesis focuses on omega automata, specifically Rabin automata. It introduces fundamental concepts related to automata accepting infinite words. The theoretical part describes their properties, acceptance conditions, and possible applications. The thesis also includes a program designed for working with Rabin automata, which allows users to create, edit, visualize, simulate, and perform operations on these automata. Due to the complexity of some operations on Rabin automata, Muller automata have been integrated into the program, as these operations can be implemented more efficiently with them. The program features a graphical user interface and a test suite of automata stored in JSON format. The goal of this thesis is to help users better understand Rabin automata, provide them with tools for manipulating these automata, and demonstrate their application through concrete examples.