Back to Results
First PageMeta Content
Formal languages / Combinatorics / Mathematics / Discrete mathematics / Alphabet / String / Finite-state machine / Structure / Regular expression / Induction of regular languages / Indexed grammar


CS 150 Lecture Slides Motivation • Automata = abstract computing devices • Turing studied Turing Machines (= computers) before there were any real computers • We will also look at simpler devices than
Add to Reading List

Document Date: 2015-01-28 19:20:52


Open Document

File Size: 594,85 KB

Share Result on Facebook