ITEC 420 2021fall ibarland

home—lectures—recipe—exams—hws—D2L—zoom (snow day)

lecture notes

The lectures (recorded) are largely based on:

• Dr Okie's notes
• the textbook's powerpoints, edited (D2L)
• the plain-text file we write in during lectures

Apology: The Zoom-recordings do not capture my "webcam" feed, when I draw on paper; I am sorry!

• The overview of the entire semester's content
• recording for 2020-aug-12 (Wed) the semester in one hour: computation models and (only stated:) their limits
• recording for 2020-aug-14 (Fri) Defining an FSM (via `b(ba*b)*`) (part 1) and recording for 2020-aug-14 (Fri) explaining notation (incl. “∈”, “Σ*” and function-spaces). (part 2).
  Part 1 is the portion where the distance-attendees had been accidentally bumped off and unable to rejoin!
• aug-17 (Mon): cardinalities, lexicographic ordering, a language = (sub)set-of-strings
• recording for 2020-aug-19 (Wed) cardinalities of ℕ, ℚ, ℝ
• review hw01a soln: sets, cross-product, …
• review hw01b soln: logic, induction
• recording for 2020-aug-26 (Wed) Definitions: String operations, and Language operations
• 2020-aug-28 (Fri) FSM intro&examples (on D2L)
• recording for 2020-aug-31 (Mon) practice writing DFSMs
• review hw02 soln; configurations; some more practical state-machine uses
• recording for 2020-sep-04 (Fri) other FSMs; Non-determinism; motivate equivalence
• ??
• recording for 2020-sep-09 (Wed) Writing NFDSMs, incl. language-union and -intersection
• recording for 2020-sep-11 (Fri) N/DFSM: subset-construction example
• recording for 2020-sep-14 (Mon) Work through another subset-construction example
• recording for 2020-sep-16 (Wed) General proof: any NDFSM has equivalent DFSM; bonus FSM variation: Markov processes
• recording for 2020-sep-18 (Fri) Regular expressions/languages
• recording for 2020-sep-21 (Mon) Writing regular expressions. (Remember to consider false-positives!)
• recording for 2020-sep-23 (Wed) regexp → NFA
• recording for 2020-sep-25 (Fri) finish regexp → NFA; NFA → regexp
• recording for 2020-sep-28 (Mon) practical extensions to regexps; start pumping lemma for DFAs
• recording for 2020-sep-30 (Wed) Pumping Lemma to show aⁿbⁿ non-regular
• review hw04 soln
• recording for 2020-oct-05 (Mon) Context-Free Grammars: Intro; see intro grammars/BNF
• recording for 2020-oct-07 (Wed) CFGs with loops
• 2020-oct-09 (Fri): Whoops, forgot to click <Record>. Worked on Ch11 (Grammar) slides.
• recording for 2020-oct-12 (Mon) review exam01; notation for CFG, derivation; more CFG examples
• recording for 2020-oct-14 (Wed) validate/prove certain CFGs (balanced parens; #a=#b); parse trees
• recording for 2020-oct-16 (Fri) ambiguous grammars (and some fixes); PDA intro
• recording for 2020-oct-19 (Mon) example PDAs; formal definition
• recording for 2020-oct-21 (Wed) PDAs ~ CFGs
• recording for 2020-oct-23 (Fri) pumping lemma for CFGs (aⁿbⁿcⁿ); Turing Machine intro
• recording for 2020-oct-26 (Mon) TM examples; the TM simulator site and code for book's machine the duplicate-word we wrote in lecture
• recording for 2020-oct-30 (Fri)
• recording for 2020-nov-02 (Mon) TM variants: multi-track, multi-tape, *Non-Deterministic
• recording for 2020-nov-04 (Wed) Deciding vs. Semi-deciding; NDTM -> DTM construction (image
• recording for 2020-nov-06 (Fri) Encoding a TM
• recording for 2020-nov-09 (Mon) review hw problem: unary subtract; Universal TM
• recording for 2020-nov-11 (Wed) Undecidability: the Halting Problem
• recording for 2020-nov-13 (Fri) P vs. NP; reductions and completeness

Btw: video: There is a Hole in Math (33m59s) (an overview of the uncountably infinite, undecidability, and incompleteness)

home—lectures—recipe—exams—hws—D2L—zoom (snow day)

This page licensed CC-BY 4.0 Ian Barland Page last generated

Please mail any suggestions (incl. typos, broken links) to ibarlandradford.edu