Computing Science 474 | CMPT474 |
---|---|

Formal Languages, Automata and Computability |
3 (3-0-0-0) |

Formal grammars; normal forms; relationship between grammars and automata; regular expressions; finite state machines, state minimization; pushdown automata; Turing machines; computability; complexity; introduction to recursive function theory.
Course availability and timesFurther information: *9 additional credits of Mathematics to a total of 12 including MAT 200Special Conditions: |