Article (Scientific journals)
Reactive automata
Crochemore, Maxime; Gabbay, Dov M.
2011In Information and Computation, 209 (4), p. 692–704
Peer reviewed
 

Files


Full Text
1-s2.0-S0890540111000137-main.pdf
Publisher postprint (838.8 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Automaton; Language representation; Reactivity
Abstract :
[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 :
Computer science
Identifiers :
UNILU:UL-ARTICLE-2011-503
Author, co-author :
Crochemore, Maxime
Gabbay, Dov M. ;  King’s College London, Department of Computer Science, London, UK ; Bar-Ilan University, Ramat-Gan, Israel
Language :
English
Title :
Reactive automata
Publication date :
2011
Journal title :
Information and Computation
ISSN :
0890-5401
Publisher :
Academic Press, San Diego, United States - California
Volume :
209
Issue :
4
Pages :
692–704
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 10 March 2014

Statistics


Number of views
54 (2 by Unilu)
Number of downloads
40 (0 by Unilu)

Scopus citations®
 
20
Scopus citations®
without self-citations
9
OpenCitations
 
15
WoS citations
 
14

Bibliography


Similar publications



Contact ORBilu