Lecture Theory of Automata: Lesson 29. The main topics covered in this chapter include: example of prefixes of a language, theorem: pref(Q in R) is regular proof and example, decidability, deciding whether two languages are regular or not, method 1 and example, method 2 and example, . |