YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS
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 .....
Turing Completeness | |
Simulation | |
Turing Halting | |
None of the mentioned |
Question 22 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Can a DFA simulate NDFA
no | |
yes | |
maybe | |
not at all |
Question 23 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Regular expressions are closed under
Union | |
Intersection | |
Kleen star | |
All th above |
Question 24 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
this is not reguler set of reguler expression
(0 + 10*)
0 | |
1 | |
100 | |
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
DFA | |
NFA | |
$\epsilon$-NFA | |
All the above |
There are 25 questions to complete.