scientific article; zbMATH DE number 176240

zbMATH Open0765.68098MaRDI QIDQ4035344FDOQ4035344

Authors: Daniel J. Rosenkrantz, H. B. III Hunt 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Complexity of E0L structural equivalence
• Complexity of E0L structural equivalence
• A categorical view to structural complexity
• Equivalence Relations on Classes of Computable Structures
• Separable equivalence, complexity and representation type
• Structurable equivalence relations
• Structure and Equivalence
• Essential structure of proofs as a measure of complexity
• scientific article; zbMATH DE number 4166857

zbMATH Keywords

structural equivalencestructural containmentstructural similarities of grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Cited In (3)

• Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete
• Testing for grammatical coverings
• Structure and Equivalence

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 Q4035344)