Notes: Automata, Grammars, and Computability

Week 1 (01/09, 01/11)

• Automata are machines. They have a grammar that they can follow.
• Deterministic finite automata are a subset of FSM. It can take in input from the set $\Epsilon$. For each input character from the set, there is an arrow drawn for each state.
• $\epison$ is used to represent an empty String.
• Strings are sequences, not sets. Order matters.