LING 190 - Formal Grammars

Periodically
Natural language as a formal system. Various types of grammars: finite state, context-free and transformational grammars. These systems are studied from the algebraic, automata and the rewriting rule points of view.

Prerequisites & Notes
A total of 6 s.h. from linguistics, mathematics or computer science courses.

Credits: 3 s.h.