Next:
Theorem 3
Up:
Theorem 2
Previous:
Theorem 2
The union of two recursive languages is recursive
Run the two algorithms sequentially or in parallel; If each will halt independently, the union will halt [Hopcroft, Theorem 8.2].
root
6/10/1998
