Generátor grafů konečných automatů - doplnění o operace s konečnými automaty

Abstract

The dissertation is a follow-up to the dissertation "Addition of new features to a generator of finite-automata graphs", written by Pavel Bym. The first part contains fundamental information about sequential machines, how they work and how they are made. The following part describes the operations which can be carried out through the sequential machines. The initial programme was a simple editor and did not include these functions - the programme was only able to define the sequential machines manually or to generate itself on a random basis. Moreover, the programme includes a GasTex compiler of dicts. The final part contains the description of the implementation of new operations: the intersection, the union, the conversion of the nondeterministic sequential machine, the conversion into a normative shape, the conversion into the minimal shape of the machine and the mirror image of the initial programme. JavaCC has been used for implementation. The graphics of the application has been adjusted as well.