|
Dec 26, 2024
|
|
|
|
CS 3186 - Introduction to Automata Theory (3) Prerequisites: CS 2013, CS 2148. Formal approach to automata theory; finite state machines, regular expressions, regular languages, context free languages and Turing machines. Develops mathematical foundation for computer science.
Add to Portfolio (opens a new window)
|
|