• 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...
    29 KB (3,422 words) - 02:57, 21 May 2025
  • Thumbnail for Regular expression
    validation. Regular expression techniques are developed in theoretical computer science and formal language theory. The concept of regular expressions...
    97 KB (8,871 words) - 12:07, 26 May 2025
  • language theory, the ω-regular languages are a class of ω-languages that generalize the definition of regular languages to infinite words. As regular...
    5 KB (652 words) - 02:28, 10 April 2025
  • Thumbnail for Pumping lemma for regular languages
    theory of formal languages, the pumping lemma for regular languages is a lemma that describes an essential property of all regular languages. Informally,...
    15 KB (2,290 words) - 06:31, 14 April 2025
  • REgular LAnguage description for XML (RELAX) is a specification for describing XML-based languages. A description written in RELAX is called a RELAX grammar...
    3 KB (320 words) - 10:38, 31 May 2024
  • began in 1936 Regular inflection, the formation of derived forms such as plurals in ways that are typical for the language Regular verb Regular script, the...
    8 KB (1,019 words) - 01:20, 25 May 2025
  • theoretical computer science and formal language theory, a regular grammar is a grammar that is right-regular or left-regular. While their exact definition varies...
    8 KB (988 words) - 21:36, 23 September 2024
  • theory, induction of regular languages refers to the task of learning a formal description (e.g. grammar) of a regular language from a given set of example...
    29 KB (3,294 words) - 22:56, 16 April 2025
  • Thumbnail for LL grammar
    \Sigma ^{*}} is called a regular partition if for every R ∈ π {\displaystyle R\in \pi } the language R {\displaystyle R} is regular. Let G = ( V , Σ , R ...
    14 KB (1,997 words) - 10:49, 7 December 2023
  • Thumbnail for Formal language
    particular formal language are sometimes called well-formed words. A formal language is often defined by means of a formal grammar such as a regular grammar or...
    27 KB (3,163 words) - 09:12, 24 May 2025
  • Thumbnail for Chomsky hierarchy
    nonterminal (left regular). These generate the same languages. However, if left-regular rules and right-regular rules are combined, the language need no longer...
    12 KB (1,348 words) - 19:34, 7 May 2025
  • Thumbnail for Language
    family. One type of mixed language called pidgins occurs when adult speakers of two different languages interact on a regular basis, but in a situation...
    139 KB (16,424 words) - 08:32, 4 April 2025
  • Regular Show (known as Regular Show in Space during its eighth season) is an American animated sitcom created by J. G. Quintel for Cartoon Network. It...
    67 KB (5,558 words) - 04:36, 20 May 2025
  • Star height (category Formal languages)
    formal languages, the star height is a measure for the structural complexity of regular expressions and regular languages. The star height of a regular expression...
    10 KB (1,352 words) - 02:29, 3 December 2023
  • These characters appear in the American animated television series Regular Show, created by J. G. Quintel for Cartoon Network. The series revolves around...
    199 KB (31,275 words) - 07:14, 23 May 2025
  • DFA; i.e., a DFA recognizing the same formal language. Like DFAs, NFAs only recognize regular languages. NFAs were introduced in 1959 by Michael O. Rabin...
    29 KB (4,499 words) - 06:31, 14 April 2025
  • input symbol x in Σ, δ(qi,x) ≠ δ(qj,x). A formal language is p-regular (also: a pure-group language) if it is accepted by a permutation automaton. For...
    4 KB (453 words) - 06:31, 14 April 2025
  • The Canons Regular of St. Augustine are Catholic priests who live in community under a rule (Latin: regula and κανών, kanon, in Greek) and are generally...
    80 KB (10,805 words) - 04:38, 27 May 2025
  • Generalized star-height problem (category Formal languages)
    Unsolved problem in computer science Can all regular languages be expressed using generalized regular expressions with a limited nesting depth of Kleene...
    3 KB (361 words) - 14:52, 12 December 2022
  • L/R of L by a regular language R The context-free languages are not closed under intersection. This can be seen by taking the languages A = { a n b n...
    15 KB (2,152 words) - 18:30, 9 December 2024
  • Thumbnail for Finite-state machine
    acceptor. By definition, the languages accepted by acceptors are the regular languages. The problem of determining the language accepted by a given acceptor...
    40 KB (4,529 words) - 09:20, 27 May 2025
  • Thumbnail for Context-free grammar
    Context-free grammar (category Programming language topics)
    whether its language is regular, nor whether it is an LL(k) language for a given k.: 254  There are algorithms to decide whether the language of a given...
    46 KB (6,143 words) - 21:09, 21 April 2025
  • Thumbnail for Deterministic finite automaton
    the input string will be accepted. The language recognized by M is the regular language given by the regular expression (1*) (0 (1*) 0 (1*))*, where...
    29 KB (3,736 words) - 06:30, 14 April 2025
  • Thumbnail for Automata theory
    formal language to be regular, and an exact count of the number of states in a minimal machine for the language. The pumping lemma for regular languages, also...
    32 KB (3,851 words) - 14:40, 16 April 2025
  • science and formal language theory, a regular tree grammar is a formal grammar that describes a set of directed trees, or terms. A regular word grammar can...
    12 KB (1,300 words) - 03:57, 15 July 2024
  • computer science and formal language theory, a regular language is said to be star-free if it can be described by a regular expression constructed from...
    5 KB (551 words) - 09:21, 9 March 2025
  • A regular verb is any verb whose conjugation follows the typical pattern, or one of the typical patterns, of the language to which it belongs. A verb...
    18 KB (2,548 words) - 05:52, 26 February 2025
  • Thumbnail for XML
    Extensible Markup Language (XML) is a markup language and file format for storing, transmitting, and reconstructing data. It defines a set of rules for...
    59 KB (7,244 words) - 02:06, 21 April 2025
  • refers to a theorem that asserts that the set of ω-regular languages is identical to the set of languages recognizable by deterministic Muller automata. This...
    15 KB (2,323 words) - 02:52, 12 April 2025
  • Star height problem (category Formal languages)
    star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star height...
    10 KB (1,353 words) - 00:39, 18 March 2024