Jan 28, 2025  
2014-2015 Catalog 
    
2014-2015 Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CSCI 510 - Automata and Formal Language Theory


Advanced treatment of formal languages and automata; finite state machines; stack machines and Turing Machines; the Chomsky hierarchy; regular, context free, context sensitive languages, recursively enumerable languages.

Prerequisites & Notes:
CSCI 301 or equivalent

Credits: 4
Grade Mode: Letter





Add to Portfolio (opens a new window)