/DFA

DFA (Deterministic Finite Automata)

Primary LanguageCMIT LicenseMIT

DFA [Theory Of Computation]

∑ = {0, 1} accepting string :

  • starting with 1 and end with 0
  • starting with 01
  • with even number of 0's

∑ = {a, b} accepting string :

  • starting and ending with 'a'