234 search results - page 8 / 47 » On Quasi-Products of Tree Automata |
116
click to vote
SBBD
2007
15 years 2 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
119
click to vote
DLOG
2006
15 years 2 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
101
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
IJFCS
2007
15 years 1 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...