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.
Highly Cited
2012
Highly Cited
2012
Semantic Parsing with Bayesian Tree Transducers
Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while… 
Highly Cited
2010
Highly Cited
2010
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle… 
2006
2006
A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata
Ranked lists of output trees from syntactic statistical NLP applications frequently contain multiple repeated entries. This… 
2001
2001
Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks
Recently, a number of authors have explored the use of recursive neural nets (RNN) for the adaptive processing of trees or tree… 
1994
1994
On Two-Way Tree Automata
1993
1993
Rewriting and Tree Automata
We summarize the main connections between rewriting, automata, and logical languages. We recall and illustrate from a rewriting… 
1992
1992
Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees
  • D. Seese
  • Tree Automata and Languages
  • 1992
  • Corpus ID: 34757081
1989
1989
Context-Free NCE Graph Grammars
The aim of this paper is to show some close relationships between context-free graph grammars and concepts from string language… 
1983
1983
Pushdown tree automata
We define topdown pushdown tree automata (PDTA's) which extend the usual string pushdown automata by allowing trees instead of… 
1979
1979
Pallel parsing of tree languages for syntactic pattern recognition
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)