Q.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
Q.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
Q.3
A DFA cannot be represented in the following format
  • a) Transition graph
  • b) Transition Table
  • c) C code
  • d) None of the mentioned
Q.4
What the following DFA accepts?
Questionautomata-theory-questions-answers4.jpg
  • 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
Q.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
Q.6
What does the following figure most correctly represents?
Questionautomata-theory-questions-answers6.jpg
  • a) Final state with loop x
  • b) Transitional state with loop x
  • c) Initial state as well as final state with loop x
  • d) Insufficient Data
Q.7
Which of the following will not be accepted by the following DFA?
Questionautomata-theory-questions-answers7.jpg
  • a) ababaabaa
  • b) abbbaa
  • c) abbbaabb
  • d) abbaabbaa
Q.8
Which of the following will the given DFA won’t accept?
Questionautomata-theory-questions-answers8.jpg
  • a) ε
  • b) 11010
  • c) 10001010
  • d) String of letter count 11
Q.9
Can a DFA recognize a palindrome number?
  • a) Yes
  • b) No
  • c) Yes, with input alphabet as ∑*
  • d) Can’t be determined
Q.10
Which of the following is not an example of finite state machine system?
  • a) Control Mechanism of an elevator
  • b) Combinational Locks
  • c) Traffic Lights
  • d) Digital Watches
0 h : 0 m : 1 s