Language acceptance by Deterministic Finite Automata (DFAs)

Procedure

  1. Please go through the theory to understand the formalisms of Deterministic finite automaton (DFAs).
  2. Once you are well acquainted with the theoretical aspects of DFAs, you may head to the simulation section of this experiment. Here, you would see a deterministic finite automata, an input string, and some controls. Please follow the instructions at the top of the page to help you use the controls. This simulation helps you understand the notion of "string acceptance by a deterministic finite automaton".
  3. We strongly advise you to do the pre- and post-tests to gain more familiarity with the concepts.