◀ ▲ ▶Branches / Theoretical-computer-science / Formal-languages / Definition: Equivalent Grammars

Definition: Equivalent Grammars

Two grammars $G_1,G_2$ are called equivalent if and only if they generate identical languages $L(G_1)=L(G_2).$

Thank you to the contributors under CC BY-SA 4.0!

Github:

References

Bibliography

1. Erk, Katrin; Priese, Lutz: "Theoretische Informatik", Springer Verlag, 2000, 2nd Edition
2. Hoffmann, Dirk: "Theoretische Informatik, 3. Auflage", Hanser, 2015