|
Aug 14, 2024
|
|
|
|
CS 4170 - Theory of Automata Units: 4 Formal models of automata, language, and computability and their relationships. Finite automata and regular languages. Pushdown automata and context-free languages. Turing machines, recursive functions, algorithms and decidability. Prerequisites: MATH 1305 , MATH 2101 , MATH 2150 .
Add to Folder (opens a new window)
|
|