scientific article; zbMATH DE number 4016185

zbMATH Open0625.68027MaRDI QIDQ3028337FDOQ3028337

Authors: Max Dauchet, Francesco de Comité 

Publication date: 1987

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

Recommendations

• Linearizing term rewriting systems using test sets
• Computing linearizations using test sets
• On the descriptive power of term rewriting systems
• Algebraic semantics and complexity of term rewriting systems
• scientific article; zbMATH DE number 1354853

zbMATH Keywords

term-rewriting systemsrecursively enumerable set of terms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25) Abstract data types; algebraic specification (68Q65)

Cited In (3)

• Term rewriting with prefix context constraints and bottom-up strategies
• On relationship between term rewriting systems and regular tree languages
• Some decidability results on one-pass reductions

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