Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Computing forbidden words of regular languages
Fundamenta Informaticae - Special issue on computing patterns in strings
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Reactive Kripke Models and Contrary to Duty Obligations
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
Introducing reactive Kripke semantics and arc accessibility
Pillars of computer science
Discussion paper: changing norms is changing obligation change
DEON'12 Proceedings of the 11th international conference on Deontic Logic in Computer Science
Introducing reactive Kripke semantics and arc accessibility
Annals of Mathematics and Artificial Intelligence
Global view on reactivity: switch graphs and their logics
Annals of Mathematics and Artificial Intelligence
Completeness theorems for reactive modal logics
Annals of Mathematics and Artificial Intelligence
Introducing reactive modal tableaux
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
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.