Notes on Cambridge Maths

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Regular Formal Language

A regular formal language or a Type 3 language is produced by rules and where are variables and is a termination symbol.

Proposition

If are regular grammars and , then

  1. If RCG, then
  2. If RUG, then

Theorem

TFAE:

  1. is regular
  2. for Deterministic Automata
  3. for Nondeterministic Automata

Lemma

Regular Pumping Lemma

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Graph View

Backlinks