3.1 Regular Languages and Relations

Regular languages are exactly those languages that can be represented by regular expressions. Every automaton corresponds to a regular expression and thus to a regular language.

• 3.1.1 FSAs, Regular Expressions, and Regular Languages

• 3.1.2 Examples of Regular Expressions

• 3.1.3 Definition of Regular Expressions

• 3.1.4 Regular Expressions and FSAs

• 3.1.5 From Regular Expressions to FSAs

• 3.1.6 Regular Relations and Rewriting Rules