Deterministic Finite Automata can be described as

  • Total number of alphabet should be finite.
  • Total number of states should be finite.

Finite automata

Finite automata Finite automata can be described into two types. 1: Deterministic Finite Automata (DFA). 2: Non Deterministic Finite Automata (NDFA). Deterministic Finite Automata: DFA can be described as The…

Continue Reading Finite automata