Reactive automata

Maxime Crochemore, Dov M. Gabbay

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


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 exponential size according to the length of the expression show that reactive links provide an alternative representation of total linear size for the language.

Original languageEnglish
Pages (from-to)692-704
Number of pages13
JournalInformation and Computation
Issue number4
StatePublished - Apr 2011


  • Automaton
  • Language representation
  • Reactivity


Dive into the research topics of 'Reactive automata'. Together they form a unique fingerprint.

Cite this