OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

Regular language

 ... Computer science Formal language theory Chomsky hierarchy Recursively enumerable language Recursive language Context-free language
 1 By others on same topic  0 Discussions  Updated 2025-06-17  +Created 1970-01-01  See my version
  • Table of contents
    • Regular expression Regular language

Regular expression

 1  0 
Regular language

 Ancestors (11)

  1. Context-free language
  2. Recursive language
  3. Recursively enumerable language
  4. Chomsky hierarchy
  5. Formal language theory
  6. Computer science
  7. Computer
  8. Information technology
  9. Area of technology
  10. Technology
  11.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Regular language by Wikipedia Bot 0  1970-01-01
 View more
A regular language is a category of formal languages that can be defined by regular expressions and can be recognized by finite automata. They are one of the simplest types of formal languages in the Chomsky hierarchy and have several important properties. Key characteristics of regular languages include: 1. **Finite Automata**: Regular languages can be recognized by finite state machines (FSMs), which can be deterministic (DFA) or nondeterministic (NFA).
 Read the full article
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook