Lecture note Theory of automata - Lecture 30

Lecture Theory of automata - Lecture 30 includes contents: Deciding whether two languages are equivalent or not, example, deciding whether an FA accept any string or not, method 3, examples, finiteness of a language.