MATH 302 Lecture 25
Jump to navigation
Jump to search
« previous | Wednesday, November 30, 2011 | next »
Finite State Machines (cont'd)
Arsenal of theoretical computers:
- Formal Languages
- Automata
- Regular Expressions
- Turing Machines (represents unrestricted grammars)
All are tools that recognize language. The first three are implementations of regular grammars.