Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Automata theoryCourcelle's theoremDeterministic automatonDeterministic finite automaton

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
From Model Checking to Model Measuring
We define the model-measuring problem: given a model M and specification ϕ, what is the maximal distance ρ such that all models M… 
2012
2012
Tree-shifts of finite type
Highly Cited
2008
Highly Cited
2008
Efficient memory representation of XML document trees
Highly Cited
2006
Highly Cited
2006
Expressiveness and complexity of XML Schema
The common abstraction of XML Schema by unranked regular tree languages is not entirely accurate. To shed some light on the… 
Highly Cited
2005
Highly Cited
2005
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem… 
Highly Cited
2002
Highly Cited
2002
Capturing term dependencies using a language model based on sentence trees
We describe a new probabilistic Sentence Tree Language Modeling approach that captures term dependency patterns in Topic… 
Highly Cited
1990
Highly Cited
1990
The theory of ground rewrite systems is decidable
  • M. DauchetS. Tison
  • [] Proceedings. Fifth Annual IEEE Symposium on…
  • 1990
  • Corpus ID: 43845439
Using tree automata techniques, it is proven that the theory of ground rewrite systems is decidable. Novel decision procedures… 
Highly Cited
1976
Highly Cited
1976
A Tree System Approach for Fingerprint Pattern Recognition
The purpose of this paper is to demonstrate how a syntactic approach and, in particular, a tree system may be used to represent… 
Review
1974
Review
1974
tree automata: an informal survey
Highly Cited
1969
Highly Cited
1969
Tree Generating Regular Systems
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)