RAIRO-Theor. Inf. Appl.
Volume 48, Number 3, July-August 2014Special issue in the honor of the 14th “Journées montoises d’informatique théorique”. I.
|Page(s)||281 - 305|
|Published online||27 May 2014|
A general framework for the derivation of regular expressions
Accepted: 14 March 2014
The aim of this paper is to design a theoretical framework that allows us to perform the computation of regular expression derivatives through a space of generic structures. Thanks to this formalism, the main properties of regular expression derivation, such as the finiteness of the set of derivatives, need only be stated and proved one time, at the top level. Moreover, it is shown how to construct an alternating automaton associated with the derivation of a regular expression in this general framework. Finally, Brzozowski’s derivation and Antimirov’s derivation turn out to be a particular case of this general scheme and it is shown how to construct a DFA, a NFA and an AFA for both of these derivations.
Mathematics Subject Classification: 68Q45
Key words: Regular expressions / alternating automata / derivation / partial derivation
© EDP Sciences 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.