OurBigBook About$ Donate
 Sign in Sign up

Accessible looping terminable variable criterion

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Formal language theory Formal grammar Variable-based grammar Regular grammar
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
If a finite right-linear grammar generates an infinite language, some variable is accessible, looping, and terminable. It is the repeated variable on a sufficiently long accepting derivation.

 Ancestors (8)

  1. Regular grammar
  2. Variable-based grammar
  3. Formal grammar
  4. Formal language theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 4 / 4I / iv / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  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