Tree Automata
Tree Automata is a type of finite automaton in automata theory that operates on tree structures rather than strings, recognizing tree languages by assigning states to nodes according to transition rules associated with the tree's branching structure.
326
Publications
17.1K
Citations
410
Authors
246
Institutions
Publications per year
2017–2026
16
326
Tree automata techniques and applications
Hubert Comon, Max Dauchet, Florent Jacquemard et al. · 1997 · 1.2K citations · Full text
Tree automata, mu-calculus and determinacy
E. Allen Emerson, Charanjit S. Jutla · 2002 · 742 citations
1–5 of 326
410
12
h-index
12
h-index
9
h-index
8
h-index
7
h-index
1–5 of 410
246

Centre National de la Recherche Scientifique
Paris, France
17 h-index
38 publications
976 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
16 h-index
30 publications
742 citations
Technische Universität Dresden
Dresden, Germany
14 h-index
22 publications
624 citations
Université Paris Cité
Paris, France
12 h-index
21 publications
783 citations

University of Warsaw
Warsaw, Poland
12 h-index
22 publications
562 citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
11 h-index
16 publications
1.5K citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
10 h-index
14 publications
599 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
10 h-index
11 publications
276 citations
1–8 of 246
20 publications · 1.5K citations
17
h-index
12 publications · 428 citations
11
h-index
ENTCS · 12 publications · 208 citations
10
h-index
LMCS · 8 publications · 305 citations
8
h-index
TOCL · 7 publications · 159 citations
7
h-index
1–5