1. Recap of Finite Automata

Recap

Alphabet

$$\Sigma =\{a_0,a_1,\dots ,a_k\}$$

Word (finite automata)

$${\Sigma }^{\ast }=\{\text{all finite strings from }\Sigma \}$$

Empty word

$$ϵ\in {\Sigma }^{\ast }$$

Language

$$L\subseteq {\Sigma }^{\ast }$$

A language $L$ is the subset of all finite strings from $\Sigma$.

Need to know about Deterministic Finite Automata and NFA.