A type of Language
The simplest kind of formal language. Can be recognized by a finite automation without a stack.
A formulation for specifying tokens…
- Simple and useful theory
- Easy to understand
- Efficient to implement
Summary
A language is regular if there is a DFA that accepts . The languages accepted by all DFAs form the family of regular languages.
Languages generated by regular expressions = regular languages
How Can You Tell If a Language is Non-Regular?
- Expression nesting
- unlimited balanced parens
- Indefinite counting What is not regular?
- Counting 2 things
- Balanced parenthesis
- Nested expressions
Concepts