| Information | |
|---|---|
| has gloss | eng: A tree walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. |
| lexicalization | eng: tree walking automaton |
| instance of | e/Tree (data structure) |
| Media | |
|---|---|
| media:img | Twa-dfs.png |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint
