Unit 9: Regular Expressions and Finite-State Automata
Computer language compilers frequently use regular languages (which feature regular expressions) to match patterns within text or perform lexical analysis. This unit will introduce formal languages and state automata to prove the correctness or falsity of a language. We will see that some languages might not be valid for a state automaton, but that we can also define and create state automata for languages defined using regular expressions.
The definition of regular expressions is recursive. This definition and that of regular sets and regular expressions requires careful contemplation on your part.
The topic of formal languages and the related topic of finite state automata are not directly addressed in our two references. Our study of discrete structures has given us the background to develop these topics in instruction paragraphs.
We begin with notation, terminology, and definitions and expressions for formal languages. Then we introduce finite automata and their relationship with regular expressions, and use them to solve problems.
Completing this unit should take you approximately 5 hours.
9.1: Formal Languages
9.1.1: Polish Notation
9.1.2: Languages Defined by Regular Expressions
9.1.3: Order of Precedence Rules
9.1.4: Deciding Whether Regular Expressions Define the Same Language
9.2: Finite State Automata
9.2.1: Automaton and Accepted Language
9.2.2: Designing a Finite State Automaton
9.2.3: Simplifying Finite State Automata
Unit 9 Assessment