1146 search results - page 68 / 230 » Finite cupping sets |
ALT
2009
Springer
14 years 6 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
WIA
2009
Springer
14 years 3 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
WDAG
2007
Springer
14 years 3 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
SEW
2006
IEEE
14 years 3 months ago
2006
IEEE
The Mondex Electronic Purse is an outstanding example of industrial scale formal refinement, and was the first verification to achieve ITSEC level E6 certification. A formal a...