“Deterministic Finite Automata-Introduction and Definition”.
1. Which of the following not an example Bounded Information?
a) fan switch outputs {on, off}
b) electricity meter reading
c) colour of the traffic light at the moment
d) none of the mentioned
Answer: b
Explanation: Bounded information refers to one whose output is limited and it cannot be
said what were the recorded outputs previously until memorized.
2. A Language for which no DFA exist is a________
a) Regular Language
b) Non-Regular Language
c) May be Regular
d) Cannot be said
Answer: b
Explanation: A language for which there is no existence of a deterministic finite automata
is always Non Regular and methods like Pumping Lemma can be used to prove the
same.
3. A DFA cannot be represented in the following format
a) Transition graph
b) Transition Table
c) C code
d) None of the mentioned
Answer: d
Explanation: A DFA can be represented in the following formats: Transition Graph,
Transition Table, Transition tree/forest/Any programming Language.
, 4. What the following DFA accepts?
a) x is a string such that it ends with ‘101’
b) x is a string such that it ends with ‘01’
c) x is a string such that it has odd 1’s and even 0’s
d) x is a strings such that it has starting and ending character as 1
Answer: a
Explanation: Strings such as {1101,101,10101} are being accepted while {1001,11001}
are not. Thus, this conclusion leads to option a.
5. When are 2 finite states equivalent?
a) Same number of transitions
b) Same number of states
c) Same number of states as well as transitions
d) Both are final states
Answer: c
Explanation: Two states are said to be equivalent if and only if they have same number of
states as well as transitions.
1. Which of the following not an example Bounded Information?
a) fan switch outputs {on, off}
b) electricity meter reading
c) colour of the traffic light at the moment
d) none of the mentioned
Answer: b
Explanation: Bounded information refers to one whose output is limited and it cannot be
said what were the recorded outputs previously until memorized.
2. A Language for which no DFA exist is a________
a) Regular Language
b) Non-Regular Language
c) May be Regular
d) Cannot be said
Answer: b
Explanation: A language for which there is no existence of a deterministic finite automata
is always Non Regular and methods like Pumping Lemma can be used to prove the
same.
3. A DFA cannot be represented in the following format
a) Transition graph
b) Transition Table
c) C code
d) None of the mentioned
Answer: d
Explanation: A DFA can be represented in the following formats: Transition Graph,
Transition Table, Transition tree/forest/Any programming Language.
, 4. What the following DFA accepts?
a) x is a string such that it ends with ‘101’
b) x is a string such that it ends with ‘01’
c) x is a string such that it has odd 1’s and even 0’s
d) x is a strings such that it has starting and ending character as 1
Answer: a
Explanation: Strings such as {1101,101,10101} are being accepted while {1001,11001}
are not. Thus, this conclusion leads to option a.
5. When are 2 finite states equivalent?
a) Same number of transitions
b) Same number of states
c) Same number of states as well as transitions
d) Both are final states
Answer: c
Explanation: Two states are said to be equivalent if and only if they have same number of
states as well as transitions.
