Derivatives of regular expressions were first introduced by Brzozowski in . By recursively computing all derivatives of a regular expression, and associating a state with each unique derivative, a deterministic finite automaton can be constructed. Convergence of this process is guaranteed if uniqueness of regular expressions is recognized modulo associativity, commutativity, and idempotence of the union operator. Additionaly, through simplification based on the identities for regular expressions, the number of derivatives can be further reduced.
|Title of host publication
|Inquiries into Words, Constraints and Contexts (Festschrift in the Honour of Professor Kimmo Koskenniemi on his 60th Birthday)
|A. Arppe, xx et al.
|Place of Publication
|Stanford CA, USA
|Published - 2005
|CSLI Studies in Computational Linguistics