Sciweavers

263 search results - page 3 / 53
» Rigid Tree Automata
Sort
View
CSR
2007
Springer
13 years 12 months ago
Marrying Words and Trees
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...
Rajeev Alur
IRI
2008
IEEE
14 years 5 days ago
Modeling and synthesis of service composition using tree automata
— 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...
Ken Q. Pu, Ying Zhu
LICS
1996
IEEE
13 years 10 months ago
Relating Word and Tree Automata
In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata...
Orna Kupferman, Shmuel Safra, Moshe Y. Vardi
JCSS
2007
107views more  JCSS 2007»
13 years 5 months ago
On the minimization of XML Schemas and tree automata for unranked trees
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...
Wim Martens, Joachim Niehren
MST
2011
206views Hardware» more  MST 2011»
13 years 22 days ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
Manfred Droste, Heiko Vogler