171 search results - page 7 / 35 » On the Power of Tree-Walking Automata |
LATA
2010
Springer
14 years 7 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
We introduce a model of automaton for picture language recognition which is based on tiles and is called Wang automaton, since its description relies on the notation of Wang system...
FCT
2009
Springer
14 years 4 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
FORMATS
2009
Springer
14 years 4 months ago
2009
Springer
For software development, testing is still the primary choice for investigating the correctness of a system. Automated testing is of utmost importance to support continuous integra...