Exploring Finite Automata

Computing with limited resources

Activities

• Reading Assignment:
  • Chapter nine of What Can be Computed? A Practical Guide to the Theory of Computation
• Monday:
  • Presentation teams finalize GitHub pull request for presentation by 11:59 PM
  • All presentation slides must be built with Quarto and RevealJS
  • All students in a presentation team must contribute to the pull request
• Tuesday:
  • Instructor’s presentation on this week’s assigned topics
  • Teams complete their final practice steps for their proofgrammer presentations
• Tuesday Laboratory:
  • Module Two Proofgrammer Presentations and Evaluations
  • Teams and presentation topics assigned at the start of the week
  • Student teams present and evaluate each other’s work
• Thursday:
  • Instructor’s presentation on this week’s assigned topics
  • Charette session where students collaboratively ask and answer questions

Slides

Full Screen: Week Ten: Finite State Automata