Construction of a Deterministicω-Automaton Using Derivatives
Roman R. Redziejowski · RAIRO - Theoretical Informatics and Applications · 1999
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.