(algorithm)
Definition: Find an automaton that accepts everything which the automata accept individually.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 3 December 2007.
HTML page formatted Mon Dec 3 13:57:37 2007.
Cite this as:
Paul E. Black, "union of automata", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 3 December 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/unionautoma.html