Tree-walking automaton
id:
tree-walking-automaton-270-5707419
title:
Tree-walking automaton
text:
A tree-walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed by Aho and Ullman. The following article deals with tree-walking automata. For a different notion of tree automaton, closely related to regular tree languages, see branching automaton.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Tree-walking_automaton
date created:
date modified:
2023-07-28T09:34:48Z
main entity:
{"identifier":"Q7837653","url":"https://www.wikidata.org/entity/Q7837653"}
image:
fields total:
13
integrity:
13