|
Aug 31, 2024
|
|
|
|
CSE 4083 Formal Languages and Automata TheoryCredit Hours: 3 Presents abstract models of computers (finite automata, pushdown automata and Turing machines) and the language classes they recognize or generate (regular, context-free and recursively enumerable). Also presents applications of these models to compiler design, algorithms and complexity theory. Prerequisite: CSE 2010 or (ECE 2552 , and ECE 3541 )
Add to Personal Catalog (opens a new window)
|
|