Nondeterministic

Great... another day of learning about nondeterministic finite automata.

Nondeterministic bottom-up tree automaton recognize the class of regular tree languages.

The aim of this book is to compare deterministic, nondeterministic, and strongly nondeterministic decision trees. Conventional (deterministic) decision trees are widely used as classifiers, as a means of knowledge representation, and as algorithms.