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 languageis constructed from an ω-regular expressionwith the help of derivatives.The construction is related to Safra's algorithm, in about the same way as the classicalderivative method is related to the subset construction.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 1999
References
- 2
- Cited by