Sciweavers

1000 search results - page 11 / 200
» Dependency Tree Automata
Sort
View
STOC
1998
ACM
115views Algorithms» more  STOC 1998»
14 years 1 months ago
Weak Alternating Automata and Tree Automata Emptiness
Orna Kupferman, Moshe Y. Vardi
SBBD
2007
126views Database» more  SBBD 2007»
13 years 11 months ago
Constraint-based Tree Pattern Mining
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
BIRTHDAY
2003
Springer
14 years 2 months ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
DLOG
2006
13 years 11 months ago
PSPACE Automata for Description Logics
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 ...
Jan Hladik, Rafael Peñaloza
ICALP
2005
Springer
14 years 3 months ago
Logics for Unranked Trees: An Overview
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...
Leonid Libkin