3 Ways of Describing Regular Languages
- Regular Expressions
- Regular Grammar
- Finite-State Automata
- a regular expression is 1 way of describing a finite-state automata
- any regular expression can be implemented as a finite-state automata
- any finite-state automata can be described as a regular expression
- a regular expression is 1 way of characterizing a particular kind of formal language called regular language
- both regular expressions and finite-state automata can be used to describe regular languages
- regular grammar - is an other way of describing regular languages