Students discuss formal grammars, normal forms, the relationship between grammars and automata, regular expressions, finite state machines, pushdown automata, and Turing machine computability. Additional topics include the Halting Problem; an introduction to recursive function theory; application to programming languages; and editors and command languages (operating systems). Prerequisite: COMP 2130 (min. grade C) or COMP 2131 (min. grade C) and COMP 2230 (min. grade C) or COMP 2231 (min. grade C)
Students discuss formal grammars, normal forms, the relationship between grammars and automata, regular expressions, finite state machines, pushdown automata, and Turing machine computability. Additional topics include the Halting Problem; an introduction to recursive function theory; application to programming languages; and editors and command languages (operating systems). Prerequisite: COMP 2130 (min. grade C) or COMP 2131 (min. grade C) and COMP 2230 (min. grade C) or COMP 2231 (min. grade C)
