scientific article; zbMATH DE number 176929

MaRDI QIDQ4036763zbMATH OpenFDO

Authors Valtteri Niemi

Publication date 18 May 1993

zbMATH Keywords

E0L systemequivalence problemsnormal form grammarsstructurally equivalent E0L grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Decidability of structural equivalence of E0L grammars
• Theory Is Forever
• scientific article; zbMATH DE number 176930
• scientific article; zbMATH DE number 522868
• Publication:4725770

Cited in

(14)

• Defining families of trees with E0L grammars
• Decidability of EDT0L structural equivalence
• The strong equivalence of ET0L grammars
• scientific article; zbMATH DE number 30957 (Why is no real title available?)
• scientific article; zbMATH DE number 79067 (Why is no real title available?)
• scientific article; zbMATH DE number 176930 (Why is no real title available?)
• Complexity of E0L structural equivalence
• scientific article; zbMATH DE number 3999316 (Why is no real title available?)
• Complexity of E0L structural equivalence
• scientific article; zbMATH DE number 4189198 (Why is no real title available?)
• Theory Is Forever
• Implementation and Application of Automata
• Structural equivalence and ET0L grammars
• Decidability of structural equivalence of E0L grammars

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036763)