Regular Languages Formal Language Theory Theoretical Computer Science

A grammar is regular if and only if its rules are of the form X -> a or X -> aY, where X and Y are nonterminals and a is a terminal. Regular languages can be accepted by finite state automata. Regular languages may also be defined using regular expressions, which consist of sets of string over a finite alphabet under the operations of union, concatenation and Kleene closure.

    Top: Computers: Computer Science: Theoretical: Formal Language Theory: Regular Languages

See Also:
  • Regular Languages - This short chapter proves that regular languages are those accepted formal language theory by finite state automata.[PDF]
  • Grammars for Regular Languages - A series of pages showing that a regular theoretical grammar is regular languages either a right-linear or left-linear grammar.
  • Regular Expression Checks - Online service for verification of regular expressions.
  • Regular Expression - A Wikipedia article on regular expressions with an informal discussion, a formal definition and examples.
  • Regular Language - Basic definitions of regular languages, how they are formal language theory regular languages generated, closure properties, and comparison with context free formal language theory regular languages languages.

   MySQL - Cache Direct