FLAT S4 WS2023 QUIZZES UNIT 1

1)Which of the following cannot use Empty String transition?

• (a) FA
  

• (b) NFA
  

• (c) DFA

  
  

• (d) All of these

  
  

2)For each symbolic representation of the alphabet, there is only one state transition in?

• (a) FA
  

• (b) NFA
  

• (c) DFA

  
  

• (d) All of these

  
  

3)Dead state is not required in which of the following?

• (a) FA
  

• (b) NFA
  

• (c) DFA

  
  

• (d) All of these

  
  

4)The total time needed to run any input string in DFA is ……. than time required in NFA.

• (a) more

  
  

• (b) Less

  
  

• (c) equal

  
  

• (d) None of these

  
  

5)Which statement is correct about DFA?

• (a) All DFAs are derived from NFAs.
  

• (b) All NFAs are derived from DFAs.
  

• (c) Both can’t be derived from each other

  
  

• (d) Both a and b

  
  

6)When it is not fixed that with a specific input where to go next on which state, then it is called?

• (A). DFA
  

• (B). NFA
  

• (C). DFSA
  

• (D) SA
  

7)WHAT is the relationship between DFN and NFA based on computatinal power?

• A)DFA-->NFA

• B)NFA-->DFA

• C)EQUAL

• D)NONE