43 search results - page 1 / 9 » Rigid tree automata and applications |
IANDC
2011
12 years 11 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...
LATA
2009
Springer
13 years 11 months 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...
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
COMBINATORICA
2008
13 years 4 months ago
2008
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...