Regular language#

In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to many modern regular expressions engines, which are augmented with features that allow recognition of non-regular languages).

Examples#

• Pomsky
• regex ⭐

Community#

Sites#

• regex101: Build, test, and debug regex ⭐