Regular Language

From Citizendium, the Citizens' Compendium
Jump to: navigation, search
This article is a stub and thus not approved.
Main Article
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
This editable Main Article is under development and not meant to be cited; by editing it you can help to improve it towards a future approved, citable version. These unapproved articles are subject to a disclaimer.

In computing theory, a regular language is one that is accepted by a finite automaton.

Equivalent Characterizations

Closure Properties

Suppose are regular languages. Then the following languages are also regular.

Regular languages are also closed under homomorphic images and preimages. Suppose is a regular language and is a string homomorphism. Then the following languages are regular.