Finite Automata
Lecture 22
Seminar: Software Quality and Safety Learning By Testing
1 Module 24 Myhill-Nerode Theorem –distinguishability –equivalence classes of strings –designing FSA’s –proving a language L is not regular.
Deterministic Finite State Machines Chapter 5. Languages and Machines 2.
