RAIRO-Theor. Inf. Appl.
Volume 33, Number 2, March April 1999
|Page(s)||133 - 158|
|Published online||15 August 2002|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.