Theory of Computation (3160704) MCQs

MCQs of Regular Languages and Finite Automata

Showing 41 to 50 out of 65 Questions
2 3 4 5 6 7
41.
Which is true for Dead State?
(a) If control enters no way to come out from the state
(b) There is no necessity of the state
(c) It cannot be reached anytime
(d) If control enters FA dead
Answer:

Option (a)

42.
Both NFA and ^-NFA recognize exactly the same languages.
(a) True
(b) False
(c) May be
(d) Can't say
Answer:

Option (a)

43.
Which of the following conversion is not feasible?
(a) Regular expression to automaton conversion
(b) Automaton to Regular Expression Conversion
(c) NFA to DFA
(d) None of the mentioned
Answer:

Option (d)

44.
It is less complex to prove the closure properties over regular languages using:
(a) NFA
(b) DFA
(c) PDA
(d) Can’t be said
Answer:

Option (a)

45.
A Language for which no DFA exist is a______
(a) Regular Language
(b) Non-Regular Language
(c) May be regular
(d) Can’t decide
Answer:

Option (b)

46.
A DFA can be represented in the following format
(a) Transition graph
(b) Transition Table
(c) C code
(d) All of the mentioned
Answer:

Option (d)

47.
Can a DFA recognize a palindrome number?
(a) Yes
(b) No
(c) Yes, with input alphabet as ∑*
(d) Can’t be determined
Answer:

Option (b)

48.
L={xϵ∑=(0,1)|x=0n1n for n>=1}; Can there be a DFA possible for the language?
(a) Yes
(b) No
(c) May be
(d) Can’t be determined
Answer:

Option (b)

49.
Two finite state machines are said to be equivalent if they:
(a) Have the same number of edges
(b) Have the same number of states
(c) Recognize the same set of tokens
(d) Have the same number of states and edges
Answer:

Option (c)

50.
In Mealy Machine O/P is associated with
(a) Present state
(b) Transition
(c) Next state
(d) None of the above
Answer:

Option (b)

Showing 41 to 50 out of 65 Questions
2 3 4 5 6 7