Construction of a Deterministic ω-Automaton Using Derivatives
Ericsson Hewlett-Packard Telecommunications AB,
Västberga Allé 9, S-12625 Stockholm, Sweden; email@example.com
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.
Mathematics Subject Classification: 68Q45 / 68R15
Key words: Infinite word / omega-language / regular language / regular expression / rational language / rational expression / derivative / deterministic omega-automaton / Muller automaton.
© EDP Sciences, 1999