Encyclopedia > Tree automaton

Article Content

Tree automaton

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

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Sanskrit language

... dative, ablative, genitive, and locative. It has over ten noun declensions. Sanskrit has ten classes of verbs divided into in two broad groups: athematic[?] ...