From ω-regular expressions to Büchi automata via partial derivatives

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We extend Brzozowski derivatives and partial derivatives from regular expressions to ω-regular expressions and establish their basic properties. We observe that the existing derivative-based automaton constructions do not scale to ω-regular expressions. We define a new variant of the partial derivative that operates on linear factors and prove that this variant gives rise to a translation from ω-regular expressions to nondeterministic B¨uchi automata.

Cite

CITATION STYLE

APA

Thiemann, P., & Sulzmann, M. (2015). From ω-regular expressions to Büchi automata via partial derivatives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8977, pp. 287–298). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free