Tree automaton, Finite state machine, Tree structure, String

Navigation

Search

Toolbox


	Article


	View source


	History


	Watch


	Place Link


	Post Message

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.

Discussion

Last posted 0 of 0 messages

[no messages posted yet]

>> post message >>

You can add this article to your own "watchlist" and receive e-mail notification about all changes in this page.

This page was last modified 23:58, 8 Jan 2004.

Content is available under GNU Free Documentation License 1.2.
Powered by MediaWiki