An Algorithm for Transformation of Finite Automata to Regular Expressions

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.

• Type: Journal
• Year: 2000
• Where: INFORMATICALT
• Authors: Larisa Stanevichene, Aleksei Vylitok
• Keywords: Algorithms, Effective Graph Algorithms, INFORMATICALT 2000, Regular Expressions