Sciweavers

263 search results - page 9 / 53
» Rigid Tree Automata
Sort
View
STOC
1998
ACM
115views Algorithms» more  STOC 1998»
13 years 12 months ago
Weak Alternating Automata and Tree Automata Emptiness
Orna Kupferman, Moshe Y. Vardi
SBBD
2007
126views Database» more  SBBD 2007»
13 years 9 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...
CSL
2001
Springer
14 years 3 days ago
The Anatomy of Innocence
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definabilit...
Vincent Danos, Russell Harmer
DLOG
2006
13 years 9 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
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
13 years 7 months ago
On the rigidity of molecular graphs
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...
Bill Jackson, Tibor Jordán