3169 search results - page 252 / 634 » Robust Timed Automata |
143
click to vote
LATA
2009
Springer
15 years 12 months ago
2009
Springer
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with ...
134
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
137
click to vote
IDEAS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
139
click to vote
CAI
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
155
click to vote
CEEMAS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We are interested in understanding and simulating how humans elaborate plans in situations where knowledge is incomplete and how they interact to obtain missing informati...