English Tree-walking automaton Cited by user A3nm on 28 Jul 2023 A tree-walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings.