Abstract

this paper. Our goal is rather to provide a simple formal proof of the correctness of the algorithm. In the topic of transducing a regular expression to an automaton, the terminology is not yet uniform. Thus, linear expressions are called restricted in [11]. Also, what we denote by P and S is frequently written First and Last . The set of factors of length 2 of a language (or of the language denoted by an expression) that we write F for short is sometimes written

Citations