Tree automaton

Known as: Nondeterministic finite tree automaton, Nondeterministic tree automaton, DFTA 
A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines… (More)
Wikipedia

Related topics

Related topics

20 relations
Automata theoryCourcelle's theoremDeterministic automatonDeterministic finite automaton
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the D OM, suffer from huge memory demands: the space… (More)
  • figure 1
  • figure 2
  • figure 6
  • table 1
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
  • C.-H. Luke Ong
  • 21st Annual IEEE Symposium on Logic in Computer…
  • 2006
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Query automata over finite trees
A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Alternating tree automata, parity games, and modal {$\mu$}-calculus
A coherent exposition of the connection of alternating tree automata and modal μ-calculus is given, advocating an automaton model… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The Complexity of Tree Automata and Logics of Programs
The complexity of testing nonemptiness of finite state automata on infinite trees is investigated. It is shown that for tree… (More)
  • figure 3.1
  • figure 5.1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Weak Alternating Automata and Tree Automata Emptiness
Automata on in nite words and trees are used for speci cation and veri cation of nonterminating programs. The veri cation and the… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Tree Automata, Mu-calculus and Determinacy
  • S Jutla
  • 1991
We show that the propositional Mu Calculus is eq uivalent in expressive power to nite automata on in nite trees Since… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Deciding Equivalence of Finite Tree Automata
We s h o w : f o r mJe~j constant m i t can be decided i n p o l y n o m i a l t ime whether or not two m-ambiguous finite tree… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Trees, Automata, and Games
In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you… (More)
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Mappings and grammars on trees
Recent developments in the theory of automata have pointed to an extension of the domain of definition of automata from strings… (More)
  • figure 1
  • figure 2
  • figure 6
Is this relevant?