updated: 2022-01-23_12:32:30-05:00

Regular Language

• A language that can be defined by a DFA
• See also: Finite Automata,
• We can describe a Regular Language using Regular Expressions

Is a regular language if and only if:

1. There is a DFA that accepts all the strings in the language
2. NFA
3. There is some Regular Expression that describes the language