Automata Simulator

there is DFA DPDA and Turing non deterministic automata s will be add later smelly and not clean code on github for practice make these: DFA:  ∑ = {0, 1} accepts even number of 0's and even number of 1's ∑ = {0, 1} accepts the set of all strings with three consecutive 0's DPDA: ∑ = {0, 1} accepts strings with same number of 0's and 1's ∑ = {a, b} accepts strings with n number of a's then 2n of b's…