245 search results - page 2 / 49 » Tree pattern mining with tree automata constraints |
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
Tree automata with one memory have been introduced in
FROCOS
2007
Springer
15 years 5 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:...
IRI
2008
IEEE
15 years 5 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...
JCSS
2007
14 years 11 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
112
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...