July 2026
Intermediate
270 pages
10h 6m
English
In Chapter 2 we introduced regular expressions and regular grammars, which are tools used to generate regular languages. Then, in Chapter 7 we defined and discussed finite automata.
In this Chapter, we integrate notions of grammars and automata. Specifically, we show that regular expressions, regular grammars and finite automata are equivalent. They generate (expressions and grammars) and accept (automata) the same family of languages, i. e., regular languages. Also, we prove the pumping lemma for regular languages. Let us recall that this lemma was formulated in Chapter 2 and then used as a tool to process languages. Then we formulate and prove the most profound ...
Read now
Unlock full access