From Mirkin's prebases to Antimirov's word partial derivatives
Our aim is to give a proof of the fact that two notions related to regular expressions, the prebases due to Mirkin and the partial derivatives introduced by Antimirov lead to the construction of identical nondeterministic automata recognizing the language of a given regular expression.
prebases partial derivatives regular expressions finite automata