An Algorithm for Transformation of Finite Automata to Regular Expressions
Volume 11, Issue 1 (2000), pp. 65–70
Pub. online: 1 January 2000
Type: Research Article
Received
1 January 2000
1 January 2000
Published
1 January 2000
1 January 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.