DocumentCode :
2182053
Title :
Conservative extensions of regular languages
Author :
Bouchou, Béatrice ; Duarte, Denio ; Alves, Mírian Halfeld Ferrari ; Laurent, Dominique ; Musicante, Martin A.
Author_Institution :
Univ. Francois Rabelais, Antenne de Blois, France
fYear :
2004
fDate :
11-12 Nov. 2004
Firstpage :
99
Lastpage :
109
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.
Keywords :
finite state machines; formal languages; GREC algorithm; conservative extensions; regular expression; regular languages; Computer science; Learning automata; Societies; XML;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science Society, 2004. SCCC 2004. 24th International Conference of the Chilean
Print_ISBN :
0-7695-2185-1
Type :
conf
DOI :
10.1109/QEST.2004.7
Filename :
1372110
Link To Document :
بازگشت