CSE 460 EFA Lesson 1: Emergent Finite Automata
This is a course CSE 460, Computability and Formal Language Theory. The later part of Lecture 6 teaches a new subject related to the course, Emergent Finite Automata (EFA). This is lesson 1 of EFA. We review the conventional (symbolic) Finite Automata (FAs). Then we taught non-deterministic FA (NFA). Much of the lecture is devoted to EFA. The next lesson EFA Lesson 2 will give an example of EFA corresponds to a symbolic FA.