Open In App

Regular Expressions, Regular Grammar and Regular Languages

As discussed in

Chomsky Hierarchy

, Regular Languages are the most restricted types of languages and are accepted by finite automata.  

Regular Expressions

Regular Expressions are used to denote regular languages. An expression is regular if:


Article Tags :