23 search results - page 1 / 5 » Branching Pushdown Tree Automata |
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
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...
FSEN
2009
Springer
13 years 11 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...