scientific article; zbMATH DE number 4016185

MaRDI QIDQ3028337zbMATH OpenFDO

Authors Max Dauchet, Francesco de Comité

Publication date 1987

zbMATH Keywords

recursively enumerable set of termsterm-rewriting systems

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Linearizing term rewriting systems using test sets
• Some decidability results on one-pass reductions
• Term rewriting with prefix context constraints and bottom-up strategies
• On relationship between term rewriting systems and regular tree languages
• Restricting tree grammars with term rewriting
• Tail reduction free term rewriting systems revisited

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)