FLAT QUIZ

1) The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1

• a) 01,0011,010101
  

• b) 0011,11001100
  

• c) ε,0011,11001100
  

• d) ε,0011,11001100
  

2)Which of the following is not a part of 5-tuple finite automata?

• a) Input alphabet
  

• b) Transition function
  

• c) Initial State
  

• d) Output Alphabet
  

3)Moore Machine is an application of:

• a) Finite automata without input
  

• b) Finite automata with output
  

• c) Non Finite automata with output
  

• d) None of the mentioned
  

4)In Moore machine, output is produced over the change of:

• a) transitions
  

• b) states
  

• c) all of the mentioned
  

• d) none of the mentioned
  

5)The output alphabet can be represented as:

• a) δ
  

• b) ∆
  

• c) ∑
  

• d) None of the mentioned
  

6)Which of the following is a correct statement?

• a) Moore machine has no accepting states
  

• b) Mealy machine has accepting states
  

• c) We can convert Mealy to Moore but not vice versa
  

• d) All of the mentioned
  

7)According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}
Statement 1: q ϵ Q’; Statement 2: FϵQ

• a) Statement 1 is true, Statement 2 is false
  

• b) Statement 1 is false, Statement 2 is true
  

• c) Statement 1 is false, Statement 2 may be true
  

• d) Statement 1 may be true, Statement 2 is false
  

8)8. The maximum number of transition which can be performed over a state in a DFA?
∑= {a, b, c}

• a) 1
  

• b) 2
  

• c) 3
  

• d) 4
  

9)The number of tuples in an extended Non Deterministic Finite Automaton:

• a) 5
  

• b) 6
  

• c) 7

• d) 4
  

10)What is wrong in the given definition?
Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})

• a) The definition does not satisfy 5 Tuple definition of NFA
  

• b) There are no transition definition
  

• c) Initial and Final states do not belong to the Graph
  

• d) Initial and final states can’t be same