Some Formal Definitions
A Deterministic Finite Automata (DFA) is
Defining how strings act on DFAs.
The language of a DFA
Some Examples, Maybe?
Let’s construct a DFA that accepts only strings beginning with a 1 that, when interpreted as binary numbers, are multiples of 5. So some examples of strings that would be in are 101, 1010, 1111