234 search results - page 2 / 47 » On Quasi-Products of Tree Automata |
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:...
CSL
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
Tree automata with one memory have been introduced in
CSR
2007
Springer
13 years 11 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
IRI
2008
IEEE
13 years 11 months ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...