Name
Abstract | ||
|---|---|---|
Given a regular expression E and a word w belonging to the language associated to E (i.e. w ∈ L(E)), we consider the following problem: Let the word w' be obtained from w by adding or removing one symbol. In this case, we are interested in building new regular expressions E' such are similar to E and such that L(E) ∪ {w'} ⊆ L(E'). The new regular expressions are computed by an algorithm called GREC that performs changes on a finite state automaton accepting L(E), in order to derive the new regular expressions E'. Our method consists in proposing different choices, permitting the evolution of the data belonging to an application. As the final choice depends on the intended semantics for the data, it is left to an advised user. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/QEST.2004.7 | SCCC |
Keywords | DocType | ISBN |
following problem,finite state machines,new regular expression,regular expression,regular languages,grec algorithm,finite state automation,different choice,final choice,formal languages,word w,conservative extensions,new regular expressions e,regular expression e,intended semantics,regular language | Conference | 0-7695-2185-1 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| beatrice bouchou | 1 | 91 | 10.71 |
| Denio Duarte | 2 | 48 | 6.45 |
| Mirian Halfeld Ferrari Alves | 3 | 91 | 12.44 |
| Dominique Laurent | 4 | 336 | 41.56 |
| Martin A. Musicante | 5 | 98 | 20.47 |