513 search results - page 26 / 103 » Finitely Based, Finite Sets of Words |
CICLING
2003
Springer
14 years 1 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
PTS
2008
13 years 10 months ago
2008
The problem of generating checking sequences for FSMs with distinguishing sequence has been attracting interest of researchers for several decades. In this paper, a solution is pro...
TNN
1998
13 years 8 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
LOGCOM
2010
13 years 7 months ago
2010
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
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 ...