## Regular Languages and Finite Automata

Language An alphabet $$\Sigma$$ is a finite set of symbols, for example $$\Sigma=\{0,1\}$$. A string is a finite sequence of symbols from $$\Sigma$$. We denote the empty string by $$\epsilon$$. The set of all strings over $$\Sigma$$ is $$\Sigma^\star$$, using

Tagged with: , ,
Posted in Theory