tree automaton A generalization of the notion of a finite-state automaton, applying to trees rather than strings (see tree language). There are two versions. A top-down machine begins at the root of the tree; having read the symbol at a node it changes state accordingly and splits into n machines to process separately the n descendants. A bottom-up machine begins with several separate activations of itself – one at each leaf node of the tree. Whenever all the subtrees of a particular node have been processed, the machines that have processed them are replaced by a single one at that node. Its state is determined by the symbol at the node and the final states of the descendant machines.
More From encyclopedia.com
Ipoh , Ipoh •capo • Gestapo •Aleppo, depot •downtempo, tempo, uptempo •Expo •cheapo, Ipoh, peep-bo, repo •hippo •hypo, typo •oppo, topo, troppo •compo • Lim… Bo Tree , Bo tree (Bodhi tree) In Buddhism, the pipal under which the Buddha (Siddhartha Gautama) found enlightenment (bodhi) at Bodh Gaya, near Varanasi, n In… cork oak , cork oak (also cork tree) • n. an evergreen Mediterranean oak (Quercus suber), the outer layer of the bark of which is the source of cork. Upas Tree , upas tree in folklore, a Javanese tree alleged to poison its surroundings and said to be fatal to approach. An account of the tree was given in the L… Tree Shrews , Tree shrews tree shrew, small, arboreal mammal of the family Tupaiidae, found in S Asia. The 17 known species of tree shrews are classified as the or… Para Rubber Tree , rubber tree Any of several South American trees whose exudations can be made into rubber; especially Hevea brasiliensis (family Euphorbiaceae), a tal…
About this article
Updated About encyclopedia.com content Print Article
You Might Also Like