Constructing the intersection of finite automata with transition tables
Channel: Samya Daleh
Date: 2017-06-26

It works with DFA and NFA, but with DFA it's easier.

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