Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
FOSSACS
2011
Springer
10 years 9 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
WIA
2004
Springer
11 years 11 months ago
On the Complexity of Hopcroft's State Minimization Algorithm
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
Jean Berstel, Olivier Carton
ICDIM
2008
IEEE
12 years 15 hour ago
A model driven approach to the design and implementing of fault tolerant Service oriented Architectures
One of the key stages of the development of a fault tolerant Service oriented Architecture is the creation of Diagnosers, which monitors the system’s behaviour to identify the o...
Mohammed Alodib, Behzad Bordbar, Basim Majeed
books