Derivatives of regular expressions and an application

Authors:
Haiming Chen;Sheng Yu
Affiliations:
State Key Laboratory of Computer Science Institute of Software, Chinese Academy of Sciences, Beijing, China;Department of Computer Science, University of Western Ontario, London, Ontario, Canada
Venue:
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Year:
2012

Citing 9
Cited 0

From regular expressions to deterministic automata

Theoretical Computer Science
Regular expressions into finite automata

Theoretical Computer Science
Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
From regular expressions to DFA's using compressed NFA's

Theoretical Computer Science
Regular languages

Handbook of formal languages, vol. 1
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Canonical derivatives, partial derivatives and finite automaton constructions

Theoretical Computer Science
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton

WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Follow automata

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a characterization of the structure of derivatives and prove several new properties of derivatives for regular expressions. The above work can be used to solve an issue in using Berry and Sethi's result, i.e., finding the unique representatives of derivatives. As an application, an improvement of Ilie and Yu's proof of the relation between the partial derivative and Glushkov automata is presented.