July 2026
Intermediate
270 pages
10h 6m
English
Regular languages form the simplest class of formal languages. They are inductively defined by regular expressions. Regular languages also outline simple algebraic structures in the set of all words over a given alphabet. Due to this simplicity, they can be easily distinguished and identified. Regular languages are generated by regular grammars as well and – what will be discussed in Chapter 7 – they are accepted by finite automata.
In this Chapter, fundamental properties of regular expressions and regular languages are studied. We cover a discussion on the following topics: operation on regular expressions, algebraic properties of the relation induced ...
Read now
Unlock full access