171 search results - page 22 / 35 » On the Power of Tree-Walking Automata |
118
click to vote
IEEESCC
2005
IEEE
15 years 6 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
93
Voted
LICS
2002
IEEE
15 years 5 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— It has been established in the literature that the cascade interconnection of two bilinear systems does not in general produce another bilinear system. The goals of this paper ...
84
Voted
FCT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...