recategorized by
283 views
1 votes
1 votes

Let $L_{1}$ and $L_{2}$ be two languages decidable by Non-deterministic Turing machines $M_{1}$ and $M_{2}$. Using $M_{1}$ and $M_{2}$, construct a Non-deterministic Turing machine for the following languages.

  1. $L_{1} \cup L_{2}$
recategorized by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
2
2 votes
2 votes
0 answers
3