Constructing the intersection of two DFA (1st possibility)
Channel: Samya Daleh
Date: 2016-07-03

At the same time this is the prove for the closure property of regular language when constructing the intersection.

Reference:
Hopcroft, John E. ; Motwani, Rajeev ; Ullman, Jeffrey D.: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie. 2. Aufl. München [u.a.] : Pearson Studium, 2002 (Informatik), p. 170-171