Article contents
Construction of a Deterministic ω-Automaton Using Derivatives
Published online by Cambridge University Press: 15 August 2002
Abstract
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.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 1999
References
- 2
- Cited by