Automata Theory

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Automata theory GATE NET

Question 21 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The ability for a system of instructions to simulate a Turing Machine is called .....

A
Turing Completeness
B
Simulation
C
Turing Halting
D
None of the mentioned
Question 22 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Can a DFA simulate NDFA

A
no
B
yes
C
maybe
D
not at all
Question 23 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Regular expressions are closed under

A
Union
B
Intersection
C
Kleen star
D
All th above
Question 24 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
this is not reguler set of reguler expression


(0 + 10*)

A
0
B
1
C
100
D
010
Question 25 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
L={w | w=0n1m for n,m>0| } then L is accepted by which of the following

A
DFA
B
NFA
C
$\epsilon$-NFA
D
All the above
There are 25 questions to complete.