171 search results - page 24 / 35 » On the Power of Tree-Walking Automata |
121
Voted
STACS
1991
Springer
15 years 3 months ago
1991
Springer
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
111
Voted
CADE
2009
Springer
16 years 29 days ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
94
Voted
CSL
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
109
Voted
ROBOCUP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper shows how multiagent systems can be modeled by a combination of UML statecharts and hybrid automata. This allows formal system cation on different levels of ab...
109
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...