We introduce a notion of a partial derivative of a regular expression. It is a generalization to the non-deterministic case of the known notion of a derivative invented by Brzozowski. We give a constructive definition of partial derivatives, study their properties, and employ them to develop a new algorithm for turning regular expressions into relatively small NFA and to provide certain improvements to Brzozowski’s algorithm constructing DFA. We report on a prototype implementation of our algorithm constructing NFA and present some examples.
CITATION STYLE
Antimirov, V. (1995). Partial derivatives of regular expressions and finite automata constructions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 900, pp. 455–466). Springer Verlag. https://doi.org/10.1007/3-540-59042-0_96
Mendeley helps you to discover research relevant for your work.