FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
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...
WIA
2004
Springer
14 years 23 days ago
2004
Springer
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...
ICDIM
2008
IEEE
14 years 1 months ago
2008
IEEE
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...