1000 search results - page 14 / 200 » Dependency Tree Automata |
ACL
2011
13 years 1 months ago
2011
ICALP
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
SPAA
2010
ACM
14 years 2 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...