The class lecture/lab section
will meet on Tuesday and Thursday
from 3:15 PM to 4:55 PM
in RRO 217.
Date |
Topic |
20 Aug |
Syllabus &
PCP
Chapter 0: Introduction & Background, notes by Adam Whitley
— Up to Graphs
|
22 Aug |
Seth Warner on ℕ
Chapter 0: Introduction & Background, notes by Adam Whitley
|
27 Aug |
Chapter 1: Finite Automaton, notes by Adam Whitley
|
29 Aug |
grep and Python re
Chapter 1: Non-determinate finate automaton, notes by Adam Whitley
(0|1(01*0)*1)*
|
3 Sep |
Chapter 1: Finite automaton to regular expression,
notes by Adam Whitley
RE for divisible by 3,
RE for divisible by 5 — Whew
Proving non-regularity — Pumping Lemma
|
5 Sep |
FSM2Regex
Chapter 1: Regular Languages, notes by Adam Whitley
Examples: 1.73–1.77
Trip to RRO223?
|
10 Sep |
One last look at Chapter 1
(ODT)
|
12 Sep |
Eric Schmidt
— co-creator of lex
Download and follow along
A serious view: Introducing Flex and Bison
Intro to Flex and Bison, SI 413 United States Navel Academcy
Lexical Analysis With Flex, for Flex 2.6.3
|
17 Sep |
Constructive problems from HW 3 —
2nd chance on HW 3
|
19 Sep |
Section 2.1: Context-free grammars, notes by Adam Whitley
My notes on Section 2.1
|
24 Sep |
26 Sep |
My notes on Section 2.2 —
PDA ⇒ CFG & CFG ⇒ PDA
Section 2.2: Pushdown Automata, notes by Adam Whitley
|
1 Oct |
context free grammars in
100 Funny kids page
Pumping lemma for context-free
languages
Closure of regular and context-free
languages
Determinate context-free
languages
|
3 Oct |
Ullman’s
notes on proof of pumping lemma
some practice problems
|
8 Oct |
Regular expression test problems, from Adam Whitley
|
10 Oct |
Regular expression test problems, from Adam Whitley — 21-22, 20, 17-19
If needed, watch RowanRobots
pumping lemma examples over the break
Nancy Lynch on the Pigeonhole Principle and much more
Four examples
from the University of Washingtown
Susan Rodger’s JFLAP (jar): Regular Pumping Lemma ⇒ Computer goes first
|
17 Oct |
Exam 1 — Regular expressions |
22 Oct |
Exam 1 with
answers &
perl RE in action
Regular grammas
Programming with regular expressions
|
24 Oct |
CNF, notes by Adam Whitley —
my CNF effort
Backus-(Naur|normal) form for specification
Greibach normal form, LALR, and Bison for parsing
|
29 Oct |
Chapter 2 stuff —
Complete Homework 5
CFL and PDA test problems, notes by Adam Whitley with
an analysis
|
31 Oct |
5 Nov |
Exam 2 |
7 Nov |
Some Exam 2 answers
Chapter 3: Church-Turing thesis, notes by Adam Whitley
++ in Turing machine,
Turing machine
simulator
Alonzo Church,
λ
Calculus &
Y combinator,
λ everywhere
|
12 Nov |
Listing permutations
Section 4.1: Decidable Language, notes by Adam Whitley
Section 4.2: The Halting Problem, notes by Adam Whitley
Just Halting
If you really
can’t make it
|
14 Nov |
A fast look at Chapter 5
|
19 Nov |
Chapter 4 & 5: Decidability cheat sheet
A bit of Python for an exam problem
git clone https://github.com/meyerd/flex-bison-example
Problem 5 of Exam 2 with flex
and bison solutions
Shift/Reduce, Reduce/Reduce, Arbitrary context-free
|
21 Nov |
Fall 2018 CSCI 434 review by Adam Whitley:
RE and FA, CFL and PDA, Turing machines, Reductions (lightly)
CSCI 434 exams from this semester
|
3 Dec |
Exam 3
|
10 Dec |
Final Exam from 11:30 AM to 2:00 PM
Check out the Writing Part
|