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

Authors

410

  1. MY
    Moshe Y. Vardi

    Rice University, United States

    12 publications · 1.5K citations

    12

    h-index

  2. HV
    Heiko Vogler

    Technische Universität Dresden, Germany

    12 publications · 377 citations

    12

    h-index

  3. AM
    Andreas Maletti

    University of Stuttgart, Germany

    9 publications · 235 citations

    9

    h-index

  4. OK
    Orna Kupferman

    Hebrew University of Jerusalem, Israel

    8 publications · 1.1K citations

    8

    h-index

  5. TC
    Thomas Colcombet

    Université Paris Cité, France

    7 publications · 177 citations

    7

    h-index

1–5 of 410

Venues

  1. Theoretical Computer Science

    20 publications · 1.5K citations

    17

    h-index

  2. Information and Computation

    12 publications · 428 citations

    11

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 12 publications · 208 citations

    10

    h-index

  4. Logical Methods in Computer Science

    LMCS · 8 publications · 305 citations

    8

    h-index

  5. ACM Transactions on Computational Logic

    TOCL · 7 publications · 159 citations

    7

    h-index

1–5