An Algorithm for Transformation of Finite Automata to Regular Expressions
Larisa I. Stanevichene, Вылиток Алексей Александрович · 2000
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. Key words: regular sets, finite automata, construction of regular expressions. 1.