Compsci 334, Spring 2023, Exam 1

Exam 1 topics (from Linz book)

• Chapter 1
  • proof by induction
  • set theory
  • languages

• Chapter 2
  • write a DFA or NFA, formal definition, transition diagram
  • Algorithm: NFA to DFA
  • Algorithm: DFA to Minimal DFA
  • Prove that an operation applied to a regular language results in a regular language.

• Chapter 3
  • write a regular expression (re)
  • write a regular grammar (rg), formal definition
  • algorithm: re to nfa
  • algorithm: dfa to re
  • algorithm: rg to dfa
  • algorithm: dfa to rg

Exam 1 topics (from JFLAP book)

• Chapter 1-4

Exam 1 Logistics

• The exam is in person in our regular scheduled classroom at Noon on Tuesday, Feb. 7.
• Exam is closed book and closed notes.
• The exam is your own work, do not consult with anyone.