Javascript is currently not supported, or is disabled by this browser. Please enable Javascript for full functionality.

   
    May 03, 2024  
2014-2015 Graduate Catalog 
    
2014-2015 Graduate Catalog [ARCHIVED CATALOG]

Add to My Catalog (opens a new window)

CSCE 5400 - Automata Theory

3 hours

Deterministic and non-deterministic finite automata, regular expressions and sets, context-free grammars and pushdown automata. Turing machines as acceptors, enumerators and computers. Church’s thesis, universal Turing machines and the halting problem, the Chomsky hierarchy and intractable problems.

Prerequisite(s): CSCE 3110 or equivalent.



Add to My Catalog (opens a new window)