Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Two grammars over a common terminal alphabet are isomorphic when a bijection between their nonterminal alphabets maps one start symbol to the other and maps their productions bijectively after being extended to fix every terminal symbol. Isomorphic grammars are equivalent.

Ancestors (8)

  1. Equivalent grammar
  2. Context-free grammar
  3. Context-free language
  4. Formal language theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8. Home