CSci 500: Fundamental Concepts in Computing

Fall Semester 2015

Lecture Notes and Web Resources

**Lecture Notes Information:**

- These notes were written primarily to accompany use of the
textbook: Peter Linz.
*An Introduction to Formal Languages and Automata*Fifth Edition, Jones and Bartlett Learning, 2012. They refer to chapters, sections, examples, and figures in the textbook. - We wrote most of these lecture notes in Pandoc's Markdown markup language using embedded LaTeX for mathematical notation. Using the Pandoc tool, we then converted them to HTML and LaTeX.
- The HTML notes linked below contain embedded MathML.
*For best results, use an up-to-date FireFox browser or some other browser that renders MathML effectively.* - The PDF notes were generated from the LaTeX markup.

- (25 Aug) Review Syllabus and discuss course policies
- Linz Chapter 1: Introduction to the Theory of Computation [HTML] [PDF]
- Linz Chapter 2: Finite Automata [HTML] [PDF]
- Linz Chapter 3: Regular Languages and Regular Grammars
[HTML]
[PDF]
- (15-17 Sep) Linz 3.1: Regular Expressions [HTML] [PDF]
- (17-22 Sep) Linz 3.2: Connection Between Regular Expressions and Regular Languages [HTML] [PDF]
- (24 Sep) Linz 3.3: Regular Grammars [HTML] [PDF]
- (29 Sep) Work selected problems from chapter 3 and assignments 1-2; review for Exam #1 to be given on Thursday, 1 October

- Linz Chapter 4: Properties of Regular Languages
[HTML]
[PDF]
- (6-8 Oct) Linz 4.1: Closure Properties of Regular Languages [HTML] [PDF]
- (8-13 Oct) Linz 4.2: Elementary Questions about Regular Languages [HTML] [PDF]
- (13-15 Oct) Linz 4.3: Identifying Nonregular Languages [HTML] [PDF]
- Alternative explanations of the Pumping Lemma. Pumping Lemma Outline and Example by Eli Allen

- Linz Chapter 5: Context-Free Languages
[HTML]
[PDF]
- (20 Oct) Linz 5.1: Context-Free Grammars [HTML] [PDF]
- (20-22 Oct) Linz 5.2: Parsing and Ambiguity [HTML] [PDF]
- (22 Oct) Linz 5.3: Context-Free Grammars and Programming Languages [HTML] [PDF]
- (27 Oct Work selected problems from chapters 4-5 and like assignments 4-5; review for Exam #2 to be given on Thursday, 29 October

- OMIT Linz Chapter 6: Simplification of Context-Free Grammars and Normal Forms
- Linz Chapter 7: Pushdown Automata
[HTML]
[PDF]
- (3 Nov) Linz 7.1: Nondeterministic Pushdown Automata [HTML] [PDF]
- (3-10 Nov) Linz 7.2: Pushdown Automata and Context-Free Languages [HTML] [PDF]
- (10 Nov) Linz 7.3: Deterministic Pushdown Automata and Deterministic Context-Free Languages [HTML] [PDF]
- (10 Nov) Linz 7.4: Grammars for Deterministic Context-Free Grammars [HTML] [PDF]

- Linz Chapter 8: Properties of Context-Free Languages [HTML] [PDF]
- Linz Chapter 9: Turing Machines [HTML] [PDF]
- OMIT Linz Chapter 10: Other Models of Turing Machines
- (3 Dec) Linz Chapter 11: A Hierarchy of Formal Languages and Automata [HTML] [PDF]
- (1-3 Dec) Linz Chapter 12: Limits of Algorithmic Computation
[HTML]
[PDF]
- (1-3 Dec) Linz 12.1: Some Problems That Cannot Be Solved with Turing Machines [HTML] [PDF]
- (1-3 Dec) Linz 12.2: Undecidable Problems for Recursively Enumerable Languages [HTML] [PDF]
- OMIT Linz 12.3: The Post Correspondence Problem
- (1-3 Dec) Linz 12.4: Undecidable Problems for Context Free Languages [HTML] [PDF]
- OMIT Linz 12.5: A Question of Efficiency

**
UP to CSci 311 root document?
to CSci 500?
**

Copyright © 2015, H. Conrad Cunningham

Last modified: Tue Dec 29 15:37:47 CST 2015