tailieunhanh - Lecture note Theory of automata - Lecture 4

This chapter includes contents: Regular expression of EVEN-EVEN language, Difference between a* + b* and (a+b)*, Equivalent regular expressions; sum, product and closure of regular expressions; regular languages, finite languages are regular, introduction to finite automaton, definition of FA, transition table, transition diagram. | Lecture note Theory of automata - Lecture 4

TỪ KHÓA LIÊN QUAN