1423 search results - page 79 / 285 » Languages of Nested Trees |
ICALP
2004
Springer
15 years 5 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...
POPL
1994
ACM
15 years 4 months ago
1994
ACM
We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and dele...
93
Voted
APLAS
2007
ACM
15 years 3 months ago
2007
ACM
Abstract. We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not po...
101
click to vote
PODS
2010
ACM
15 years 5 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...