46 search results - page 3 / 10 » Isomorphism of regular trees and words |
NJC
2000
13 years 5 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
JIIS
2008
13 years 5 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
PR
2010
13 years 3 months ago
2010
Motion capture, a currently active research area, needs estimation of the pose of the subject. For this purpose, we match the tree representation of the skeleton of the 3D shape t...
DLT
2009
13 years 3 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
JCT
2011
13 years 6 days ago
2011
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...