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.
|Titel||Implementation and Application of Automata (Revised Selected Papers, Ninth International Conference, CIAA 2004, Kingston ON, Canada, July 22-24, 2004)|
|Redacteuren||M. Domaratzki, A. Okhotin, K. Salomaa, S. Yu|
|Plaats van productie||Berlin|
|ISBN van geprinte versie||3-540-24318-6|
|Status||Gepubliceerd - 2005|
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|