Schützenberger-like products in non-free monoids
A deterministic automaton recognizing a given -regular language is constructed from an -regular expression with the help of derivatives. The construction is related to Safra's algorithm, in about the same way as the classical derivative method is related to the subset construction.
Page 1