Multiple choice

Directions: What is the full form of the abbreviation given in bold?

DFA

  1. Deterministic Finite Automaton

  2. Decisive Finite Automaton

  3. Deterministic Future Automaton

  4. Deterministic Finite Automata
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

A Deterministic Finite Automaton (DFA) is a finite-state machine that accepts or rejects a given string of symbols by running through a state sequence uniquely determined by the string.

Keep practicing — related questions