936 search results - page 91 / 188 » FSM-Hume is finite state |
FMICS
2007
Springer
15 years 3 months ago
2007
Springer
Due to the significant progress in automated verification, there are often several techniques for a particular verification problem. In many circumstances different techniques are ...
107
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise ...
107
click to vote
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
111
click to vote
FOIKS
2008
Springer
15 years 1 months ago
2008
Springer
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
100
click to vote
EACL
2003
ACL Anthology
15 years 1 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...