up
»
Regular Languages and Relations
Abstract:
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.
Table of Contents
FSAs, Regular Expressions, and Regular Languages
Different views on the same matter.
Examples of Regular Expressions
Introduction of regular Expressions.
Definition of Regular Expressions
Definition of regular expressions.
Regular Expressions and FSAs
Regular expressions and FSAs are equivalent.
From Regular Expressions to FSAs
Proof, that there is a FSA for every regular expression.
Regular Relations and Rewriting Rules
Regular expressions also relate to finite state transducers.
up
»