198 search results - page 7 / 40 » Learning Unary Automata |
LICS
2002
IEEE
14 years 1 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
ENTCS
2007
13 years 8 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Links are established between three widely used modeling frameworks for reactive systems: the ioco theory of Tretmans, the interface automata of De Alfaro and Henzinger, and Mealy ...
COLT
2006
Springer
14 years 3 days ago
2006
Springer
HIS
2004
13 years 9 months ago
2004
In this paper, a new fuzzy clustering algorithm that uses cellular learning automata based evolutionary computing (CLA-EC) is proposed. The CLA-EC is a model obtained by combining...