Keywords

#tree-walking_automaton

Tree-walking automaton

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.

Fri 28th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Tree-walking automaton Pebble automaton Cell Peacock (Fabergé egg) Hugo (film) The Invention of Hugo Cabret Hephaestus Fields of Mistria History of robots Nezha
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.