Algoritmy pro převod regulárních výrazů na konečné automaty

Abstract

This work addresses the conversion of regular expressions to finite automata. The aim of this work is to implement several well-known algorithms in Java. I focused on the methods of transfer such that it ultimately always reach the same minimised finite automata, whether the transfer is made by an arbitrary algorithm. This allowed me to different algorithms compared to each other in terms of performance.