On the correctness of some algorithms to generate finite automata for regular expressions
ten Hmm Huub Eikelder, van Hpj Rik Geldrop · TU/e Research Portal · 1993
We discuss the method given by Glushkov, McNaughton-Yamada and Berry-Sethi and a related method given by Aho, Sethi and Ullmann to generate a deterministic finite automaton accepting the language of a given regular expression.For both methods a formal description and a simple correctness proof is given.