retagged by
256 views
0 votes
0 votes

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}$

  1. I-B, II-C, III-D, IV-F
  2. I-B, II-C, III-E, IV-A
  3. I-C, II-B, III-E, IV-F
  4. I-B, II-C, III-F, IV-D
retagged by

Please log in or register to answer this question.

Answer:

Related questions

4 votes
4 votes
0 answers
3
Bikram asked Aug 12, 2017
602 views
The number of possible finite automata with two states $a0$ and $a1$ (where $a0$ is always the initial state over the alphabet $\{p, q\}$) which accepts empty language is...
0 votes
0 votes
1 answer
4
Bikram asked Aug 12, 2017
259 views
What is the regular expression corresponding to the above DFA?$(01 + (00)^*1)^*$$0^*10^*$$(10 + 0(00)^* (1 + 01) )^*$$0(00)^*10^*$