25 search results - page 3 / 5 » The Complexity of Finding Reset Words in Finite Automata |
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
FUIN
2008
14 years 9 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
DAGSTUHL
2006
14 years 10 months ago
2006
Interorganizational cooperation is more and more organized by the paradigm of services. Service-oriented architectures (SOA) provide a general framework for service interaction. SO...
ICRA
2003
IEEE
15 years 2 months ago
2003
IEEE
We present an approach that uses Q-learning on individual robotic agents, for coordinating a missiontasked team of robots in a complex scenario. To reduce the size of the state sp...
PAAMS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...