universal state

(definition)

Definition: A state in an alternating Turing machine from which the machine accepts only if all possible moves lead to acceptance.

See also existential state.

Note: From Algorithms and Theory of Computation Handbook, page 24-18, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Author: CRC-A

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified Fri Dec 17 12:08:32 2004.
HTML page formatted Wed Oct 26 09:48:20 2005.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "universal state", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST.
http://www.nist.gov/dads/HTML/universalstt.html