📄️ Chapter 1, Automata: The Methods and the Madness
This series of documents in this column are summarized from this book: Introduction to automata theory, languages, and computation.
📄️ Summary of Chapter 1
- Finite Automata: Finite automata involve states and transitions among states in response to inputs. They are useful for building several different kinds of software, including the lexical analysis component of a compiler and systems for verifying the correctness of circuits or protocols, for example.
📄️ Chapter 2, Finite Automata
Deterministic Finite Automaton, DFA
📄️ Class Notes on 10th Oct
语言非正则性证明
📄️ Class Notes at 17th Oct, 2024
上下文无关法及上下文无关语言