Automata Theory

Description:

• Study of abstract machines and automata
  • Finite State Machine

Symbol:

• Elements such as $a,b,c,..,0,1,2,...$

Alpha/Vocabulary:

• Collection obetf symbols, $eg,\{a,b\},\{0,1,2,c,d\},...$

String:

• Sequence of symbols, $eg:aa,bb,abc,a0b1c2,...$
• Empty string is deonted by $\lambda$ or $\varnothing$ ( different from empty set $\varnothing$)

Language:

• Set of strings, ${0,1, 00,01,10,11}
• Not natural language or programming language

---