Theory of Computation (3160704) MCQs

MCQs of Regular Languages and Finite Automata

Showing 51 to 60 out of 65 Questions
3 4 5 6 7
51.
In Moore Machine O/P is associated with
(a) Present state
(b) Input
(c) Next state
(d) None of the above
Answer:

Option (a)

52.
Moore Machine is an application of:
(a) Finite automata without input
(b) Non- Finite automata with output
(c) Finite automata with output
(d) None of the mentioned
Answer:

Option (c)

53.
For a give Moore Machine, Given Input=’101010’, thus the output would be of length:
(a) |Input|+1
(b) |Input-1|
(c) |Input|
(d) Cannot be predicted
Answer:

Option (a)

54.
Null string is accepted in Moore Machine:
(a) Yes
(b) No
(c) Can’t say
(d) May be
Answer:

Option (a)

55.
The output alphabet can be represented as:
(a) δ
(b) ∑
(c) ∆
(d) None of the mentioned
Answer:

Option (c)

56.
The major difference between Mealy and Moore machine is about:
(a) Input Variations
(b) Output Variations
(c) Both
(d) None of the mentioned
Answer:

Option (b)

57.
The appropriate precedence order of operations over a Regular Language is
(a) Kleene, Union, Concatenate
(b) Kleene, Star, Union
(c) Kleene, Concatenate, Union
(d) Star, Union, Dot
Answer:

Option (c)

58.
Which of the technique can be used to prove that a language is non regular?
(a) Pumping Lemma
(b) Arden’s theorem
(c) Ogden’s Lemma
(d) Thompson's rule
Answer:

Option (a)

59.
While applying Pumping lemma over a language, we consider a string x that belong to L and fragment it into _________ parts.
(a) 2
(b) 5
(c) 3
(d) 6
Answer:

Option (c)

60.
If we select a string w such that x∈L, and x= x=uvw. Which of the following portions cannot be an empty string?
(a) u
(b) v
(c) w
(d) all of the mentioned
Answer:

Option (b)

Showing 51 to 60 out of 65 Questions
3 4 5 6 7