[en] A reactive automaton has extra links whose role is to change the behaviour of the automaton.
We show that these links do not increase the expressiveness of finite automata but that they
can be used to reduce dramatically their state number both in the deterministic case and
the non-deterministic case.
Typical examples of regular expressions associated with deterministic automata of ex-
ponential size according to the length of the expression show that reactive links provide an
alternative representation of total linear size for the language
Disciplines :
Sciences informatiques
Identifiants :
UNILU:UL-ARTICLE-2011-503
Auteur, co-auteur :
Crochemore, Maxime
GABBAY, Dov M. ; King’s College London, Department of Computer Science, London, UK ; Bar-Ilan University, Ramat-Gan, Israel
Langue du document :
Anglais
Titre :
Reactive automata
Date de publication/diffusion :
2011
Titre du périodique :
Information and Computation
ISSN :
0890-5401
Maison d'édition :
Academic Press, San Diego, Etats-Unis - Californie
