Dec 08, 2025  
2011-2012 Graduate Catalog 
    
2011-2012 Graduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CIS 770 - Formal Language Theory


Regular languages, finite automata, context-free languages, pushdown automata, context-sensitive languages, linear bounded automata, recursively enumerable languages, Turing machines.

Credits: (3)

Requisites:
Pr.: MATH 510.



Add to Portfolio (opens a new window)