Class 13
 

 

Machines and Grammars

·        Finite State Automata

·        Finite Languages, regular expressions

·        Context Free grammars (e.g. statements)

·        Push down automata

·        Turing Machines

·        Universal Turing Machines

·        Class audio

Study Guide

Much of the following articles are detailed and complex, read the gist of the material (scan them at least)

·        Finite State Automata

·        Finite Languages, regular expressions

·        Context Free grammars (e.g. statements)

·        Push down automata

·        Turing Machines

·        Universal Turing Machines (Alan Turing introduced this machine in 1936-1937)