This repository was created as a part of my 'Automata and grammars' course at FIT CTU.
This course focuses on automata theory and formal languages. The repository contains an implementation of some algorithms for finite automata in C++ for a homework task.
The goal of this task was to implement the intersection and unification of non-deterministic automata (using parallel composition). The automata had to be subsequently determinized (using powerset construction) and minimized (using Hopcroft's algorithm).
The final score for my homework was 10/10 points.