234 search results - page 37 / 47 » On Quasi-Products of Tree Automata |
JACM
2010
14 years 11 months ago
2010
125
click to vote
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
103
click to vote
SPAA
2010
ACM
15 years 6 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...
108
click to vote
MST
2010
14 years 11 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...