Thumbnail
Access Restriction
Subscribed

Author Bouchou, B. ♦ Duarte, D. ♦ Alves, M.H.F. ♦ Laurent, D. ♦ Musicante, M.A.
Sponsorship The Chilean Comput. Sci. Soc
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2004
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Computer science ♦ Learning automata ♦ XML ♦ Societies
Abstract Given a regular expression E and a word w belonging to the language associated to E (i.e. w /spl isin/ 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) /spl cup/ {w'} /spl sube/ 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.
Description Author affiliation: Univ. Francois Rabelais, Antenne de Blois, France (Bouchou, B.; Duarte, D.; Alves, M.H.F.)
ISBN 0769521851
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2004-11-12
Publisher Place Chile
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 292.09 kB
Page Count 11
Starting Page 99
Ending Page 109


Source: IEEE Xplore Digital Library