Introduction To Theory Of Computation! Hardest Trivia Quiz

18 Questions | Total Attempts: 57

SettingsSettingsSettings
Please wait...
Mathematics Quizzes & Trivia

Questions and Answers
  • 1. 
    The DFA shown below accepts the set of all strings over {0, 1} that
    • A. 

      End with 00

    • B. 

      End with 0

    • C. 

      Begin either with 0 or 1

    • D. 

      Contain the substring 00

  • 2. 
    Which one of the following is true for this automaton?
    • A. 

      B*ab*ab*ab*

    • B. 

      B*a(a+b)*

    • C. 

      B*ab*ab*

    • D. 

      (a+b)*

  • 3. 
    For the above FSA the equivalent minimum state automaton has the following number of states
    • A. 

      1

    • B. 

      2

    • C. 

      3

    • D. 

      4

  • 4. 
    The minimum number of states in any DFA accepting the regular language L = (111+11111)* is 
    • A. 

      9

    • B. 

      8

    • C. 

      11

    • D. 

      5

  • 5. 
    For the given FSA which is/are the final state and start state
    • A. 

      Q0 start state , q1 and q2 final state

    • B. 

      Q3 start state , q1 and q2 final state

    • C. 

      Q1 start state , q3 and q2 final state

    • D. 

      Q1start state , q0 and q3 final state

  • 6. 
    An automaton with a finite number of states is called a[Blank]
  • 7. 
    NDFA is an abbreviation of [Blank]
  • 8. 
    Moore machine is an FSM whose outputs depend on only the present state.
    • A. 

      True

    • B. 

      False

  • 9. 
    Moore machine is an FSM whose outputs depend on the present state and input.
    • A. 

      True

    • B. 

      False

  • 10. 
    Type 0 Grammer is
    • A. 

      Unrestricted grammar

    • B. 

      Context-sensitive grammar

    • C. 

      Context-free grammar

    • D. 

      Regular grammar

  • 11. 
    Type 1 Grammer is
    • A. 

      Context-sensitive grammar

    • B. 

      Unrestricted grammar

    • C. 

      Context-free grammar

    • D. 

      Regular grammar

  • 12. 
    Type 3 Grammer is
    • A. 

      Unrestricted grammar

    • B. 

      Context-sensitive grammar

    • C. 

      Context-free grammar

    • D. 

      Regular grammar

  • 13. 
    Type 2 Grammer is
    • A. 

      Context-free grammar

    • B. 

      Unrestricted grammar

    • C. 

      Context-sensitive grammar

    • D. 

      Regular grammar

  • 14. 
    If P does not contain null string, then R = Q + RP has a unique solution that is R = QP* is a [Blank] Theorem
  • 15. 
    The diagram represents which regular expression
    • A. 

      A

    • B. 

      A+b

    • C. 

      Ab

    • D. 

      A*

  • 16. 
    The diagram represents which regular expression
    • A. 

      Ab

    • B. 

      A+b

    • C. 

      A

    • D. 

      (a+b)*

Back to Top Back to top