Language - Regular Language


A language is regular, if its syntax can be expressed by a single context free expression. (ie they can be described by finite automata)

The requirement that a single equation suffices also implies that only terminal symbols occur in the expression. Such an expression is called a regular expression.

Programs are particularly simple and efficient:

  • for the recognition of regular sentences
  • ie for the determination of the structure of the sentence,
  • ie for the determination of whether the sentence is well-formed

Documentation / Reference

  • Chapater 2 - Book - Hopcroft, Motwani, Ullman, Automata Theory, Languages, and Computation 3rd Edition. pdf

Powered by ComboStrap