Mar 28, 2024  
2017-2018 Undergraduate Bulletin 
    
2017-2018 Undergraduate Bulletin [ARCHIVED BULLETIN]

Add to Bulletin (opens a new window)

CS 5133 Theory of Computing


(3 hours)


Finite automata. Regular languages and grammars. Properties of regular languages. Context free languages and grammars. Pushdown automata. Properties of context free languages. Chomsky hierarchy. Turing machines. Limits of algorithmic computation. Prerequisite: CS 3013  .

 



Add to Bulletin (opens a new window)