Quiz: How Well Do You Understand DFA?

10 Questions | Attempts: 839
Share

SettingsSettingsSettings
Quiz: How Well Do You Understand DFA? - Quiz

DFA is a theory of computation, a branch of theoretical computer science. Do you understand DFA? Take this DFA quiz to see how well do you know. Here, in this quiz, we have a few basic questions about DFA that will help you test your knowledge on this topic and add some extra information. Take up the quiz, and see how much you score. Try for a perfect score on this quiz. If you like the quiz, do share the quiz with other people in computer field.


Questions and Answers
  • 1. 
    What does DFA stand for?
    • A. 

      Deterministic final automata

    • B. 

      Determined finite automata

    • C. 

      Deterministic finite automata

    • D. 

      Deterministic finite automatic

  • 2. 
    It refers to the uniqueness of the computation.
    • A. 

      Determined

    • B. 

      Deterministic

    • C. 

      Feasibility

    • D. 

      Correctness

  • 3. 
    ____ and ____ were among the first researchers to introduce a concept similar to finite automaton in 1943
    • A. 

      Mckenzie and Feets

    • B. 

      McCullen and Pitts

    • C. 

      McCulloch and Fitz

    • D. 

      McCulloch and Pitts

  • 4. 
    A deterministic finite automaton without accept states and without a starting state is known as a
    • A. 

      Transition system

    • B. 

      Transmission system

    • C. 

      Transparent system

    • D. 

      Transport system

  • 5. 
    1 of Ten Closure Properties
  • 6. 
    In the _____ mode, an input string is provided, which the automaton can read from left to right.
    • A. 

      Take

    • B. 

      Accept

    • C. 

      Trance

    • D. 

      Enter

  • 7. 
    The ___ mode is similar to the accepting mode, except rather than validating an input string, its goal is to produce a list of all the strings in the language
    • A. 

      Get

    • B. 

      Generate

    • C. 

      Create

    • D. 

      Validate

  • 8. 
    Given that regular languages are, in general, infinite, automata in the generating mode tend to be more of a ______ construct.
    • A. 

      Terrestrial

    • B. 

      Theoretical

    • C. 

      Thermal

    • D. 

      Trivial

  • 9. 
    DFAs can be reduced to a ______ form.
    • A. 

      Canonical

    • B. 

      Smaller

    • C. 

      Specified

    • D. 

      General

  • 10. 
    Closure properties of DFA can also be used in ___.
    • A. 

      NPA

    • B. 

      NFA

    • C. 

      NBA

    • D. 

      NHA

Back to Top Back to top
×

Wait!
Here's an interesting quiz for you.

We have other quizzes matching your interest.