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. $L_{1} \cup L_{2}$ Theory of Computation drdocse-2022-paper2 theory-of-computation decidability turing-machine 2-marks descriptive + – admin asked Dec 15, 2022 recategorized Jan 26, 2023 by Lakshman Bhaiya admin 283 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.