 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
A tree automaton is a type of finite state machine. They deal with tree structures, rather than the strings of more conventional finite state machines.
See http://www.grappa.univ-lille3.fr/tata
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
