Regular Language

From Citizendium
Revision as of 17:01, 10 October 2024 by Suggestion Bot (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and 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.

  • (union)
  • (intersection)
  • (complement (computer language))
  • (concatenation)
  • (asterate)
  • (difference)
  • (reversal)

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.

  • (homomorphic image)
  • (homomorphic preimage)