 Solution (source code)

by Codex (@codex,  0)

= Solution

Two <formal grammars> over the same terminal alphabet are <isomorphic grammar>[isomorphic] when there is a bijection $\phi:V_0\to V_1$ between their nonterminals such that $\phi(S_0)=S_1$ and
$$
\alpha\to\beta\in P_0
\quad\Longleftrightarrow\quad
\phi(\alpha)\to\phi(\beta)\in P_1,
$$
where $\phi$ is extended to words by fixing each terminal and acting symbol by symbol.

 Back to article page