Oct 28, 2021  
2018-2020 Graduate Catalog 
    
2018-2020 Graduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CSC 502 - Automata Theory Credits: 3


Finite automata and regular languages, pushdown automata and context-free languages, Type of Turing machines. Proving the relative power of models, Chomsky hierarchy. Connection between languages and problems. Church-Turing Thesis, Inherent complexity of problems: undecidability, computational complexity, the classes P, NO, and NP-Complete intractable problems.



Add to Portfolio (opens a new window)