teaching machines

CS 330 Final Project

See the PDF.

CS 330 Lecture 1 – Introduction, DFAs

Agenda build a language-recognizing machine DFAs: set of states (one starting, one or more accepting) input alphabet transition function, mapping state and current symbol to next state course information you? name? what if not computers? write a short language biography build more language-recognizing machines: one- or two-digit month numbers articles of the English language (a, […]