- Friday (March 4)
- I’ll be out of town
- “Class” will be asynchronous online discussion of history of finite automata and regular languages
- Handout
- Math department scholarships
- Open to sophomores and juniors
- Apply by March 23
- See email invitation and/or dept. scholarships web page (www.geneseo.edu/math/scholarships)
- Faculty candidate Friday (Mar. 4)
- Extra credit as usual for colloquium write-ups
- Pumping: one of y or v could be empty
- Beginning of section 2.4
- PDA <-> NFA, DPDA <-> DFA
- Restricted use of epsilon moves
- Input moves, stack moves
- DCFL recognized by DPDA, definition of DCFL
- DCFLs proper subset of CFLs
- 0n1n example?
- Discussion
- Regular languages proper subset of DCFLs?
- Yes
- Regular language recognized by DFA which is a form of DPDA, thus subset
- 0n1n is DCFL but not regular, thus proper
- Regular languages proper subset of DCFLs?
- (Monday)
- Turing machines
- Read section 3.1