•   Best guide for exams of all nature, Competitive exams and Interviews
  • MCQS - Theory of Computation
Here is the MCQs guide for the topic of Theory of Computation. you will find various types of questions along with there answers in this
Q. A Moore machine is a collection of __________ things.
A.
two
B.
three
C.
four
D.
five


Show Answer
Q. The basic limitation of finite automata is that
A.
It can not remember arbitrary large amount of information
B.
It sometimes recognize grammar that are not regular
C.
It sometimes fails to recognize regular grammar
D.
All of the mentioned


Show Answer
Q. How many DFA exits with two states over input alphabet {0,1} ?
A.
16
B.
26
C.
32
D.
64


Show Answer
Q. Regular expression for all strings starts with ab and ends with bba is.
A.
aba*b*bba
B.
ab(ab)*bba
C.
ab(a+b)*bba
D.
All of the mentioned 9.


Show Answer
Q. Number of final state require to accept Φ in minimal finite automata.
A.
1
B.
2
C.
3
D.
None of the mentioned


Show Answer
Q. Finite automata requires minimum _______ number of stacks.
A.
1
B.
0
C.
2


Show Answer
Q. Language of finite automata is
A.
Type 0
B.
Type 1
C.
Type 2
D.
Type 3


Show Answer
Q. Languages of a automata is
A.
If it is accepted by automata
B.
If it halts
C.
If automata touch final state in its life time
D.
All language are language of automata


Show Answer
Q. Number of states require to accept string ends with 10
A.
3
B.
2
C.
1


Show Answer
Q. There are ________ tuples in finite state machine
A.
4
B.
5
C.
6
D.
7


Show Answer
Advertisment
MCQs Bucket