104 search results - page 1 / 21 » Tree Automata with Global Constraints |
LICS
2010
IEEE
13 years 4 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...
DLT
2008
13 years 7 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
LATA
2009
Springer
14 years 27 days ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
FOSSACS
2007
Springer
14 years 9 days ago
2007
Springer
Tree automata with one memory have been introduced in
IANDC
2011
13 years 1 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...