(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 Black.
Entry modified 12 February 2019.
HTML page formatted Mon May 11 15:07:58 2026.
Cite this as:
Paul E. Black, "union of automata", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 12 February 2019. (accessed TODAY)
Available from: /HTML/unionautoma.html