Generátor grafů konečných automatů - doplnění o regulární výrazy

Abstract

Bachelor thesis continues on the work "Addition to the editor and generator of finite automata graphs", prepared by Paul Byma, and supplemented the original work of the GasTexu command interpreter and global parameters. These features have been retained and added support for converting regular expressions to finite automata and back. There has been also added the ability to generate words from a language accepted by finite automaton. Thanks to the collaboration with bachelor work "Generator of finite automata graphs - the addition of operations with finite automata" by Martin Bachořík, both work are reflected in a single application.