213 search results - page 12 / 43 » Relating Word and Tree Automata |
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
TALG
2010
13 years 5 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
TCS
2008
13 years 7 months ago
2008
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...