Apr 18, 2024  
2004-2005 Graduate Bulletin 
    
2004-2005 Graduate Bulletin [ARCHIVED BULLETIN]

Add to Personal Catalog (opens a new window)

CSC 208 - Formal Languages, Grammars and Automata


Once a year
Languages, the grammars that generate them and the machines that accept them. Regular languages. Finite automata-deterministic and nondeterministic. Transition functions and state diagrams. Context-free languages and pushdown automata. Context-free grammars and compiler design. Context-sensitive languages and linear-bounded automata. Closure results.

Prerequisites & Notes
CSC 161.

Credits: 3 s.h.





Add to Personal Catalog (opens a new window)