Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Language Operations - What is the language of a regular expression?


Regular Expressions serve as an algebraic representation of languages, precisely defining regular languages. Every regular expression, E, defines a regular language, L(E), and for each E, it is possible to construct a Deterministic Finite Automaton (DFA) A, such that L(E) equals L(A).