Deterministic Finite Automaton The set of all binary strings w ∈ {0, 1}∗ that contain the pattern 0011. For example, the strings 0011, 101010011101 are in the language, while ǫ, 101011 are not in the language. Also read: Devry ECET365 Lab 3 Traffic Light Control Using Finite State Machines (FSM) QRB 560 Week 6 1 Heading Suppose we have a finite population