495 search results - page 1 / 99 » Automata and differentiable words |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
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...
LICS
1996
IEEE
13 years 8 months ago
1996
IEEE
In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata...
CAV
2012
Springer
11 years 7 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
IPL
2008
13 years 4 months ago
2008
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...