Abstract
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new proof of equivalence of regular expressions and finite automata.