77 search results - page 12 / 16 » Polynomial Interrupt Timed Automata |
CAI
2007
Springer
15 years 5 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...
ISTA
2007
15 years 7 days ago
2007
: Soccer simulation is an effort to motivate researchers to perform artificial and robotic intelligence investigations in a multi-agent system framework. In this paper, we propose ...
FUIN
2007
14 years 10 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
117
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
VMCAI
2005
Springer
15 years 4 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...