Sciweavers

213 search results - page 1 / 43
» Relating Word and Tree Automata
Sort
View
LICS
1996
IEEE
13 years 9 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
CSL
2006
Springer
13 years 4 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
ICALP
2004
Springer
13 years 10 months ago
Tree-Walking Automata Cannot Be Determinized
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
Mikolaj Bojanczyk, Thomas Colcombet
CSR
2007
Springer
13 years 11 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
IPL
2008
147views more  IPL 2008»
13 years 4 months ago
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
Olivier Gauwin, Joachim Niehren, Yves Roos