Test by Bikram | Theory of Computation | Test 2 | Question: 10

Question

Match the correct automation given in Y to its transition function in $X$:

$\begin{array}{|l|l|} \hline {} & X & {} & Y \\ \hline I. & Q^* \Sigma \rightarrow Q & A. & \text{NFA with null moves} \\ \hline II. & Q^* \Sigma \rightarrow 2Q & B. & \text{DFA} \\ \hline III. & Q^* \Sigma \rightarrow Q \times \{L,R\} & C. & \text{NFA} \\ IV. & Q^*\{ \Sigma \cup \epsilon \} \rightarrow 2Q & D. & \text{Turing Machine} \\ \hline {} & {} & E. & \text{2 way DFA} \\ \hline {} & {} & F. & \text{PDA} \\ \hline \end{array}$

• A. I-B, II-C, III-D, IV-F
• B. I-B, II-C, III-E, IV-A
• C. I-C, II-B, III-E, IV-F
• D. I-B, II-C, III-F, IV-D

Comments

that's where i made mistake

2 DFAs can be seen as read only turing machine with no work tape, only a read-only input tape, which on input can move right or left.

---

Where do I find the relevant theory for this? Book Name + Chapter name please?