D.F.A. Quiz

10 Questions | By Levinthunder | Last updated: Mar 21, 2022 | Total Attempts: 663

Questions

Settings

Create your own Quiz

Questions and Answers

1.

DFA stands 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 in left to right
- A.
  
  Take
- B.
  
  Accept
- C.
  
  Trance
- D.
  
  Enter
7.

The ___ mode is similar to 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 tends 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 be also used in ___.
- A.
  
  NPA
- B.
  
  NFA
- C.
  
  NBA
- D.
  
  NHA