scientific article; zbMATH DE number 165818

MaRDI QIDQ4033499zbMATH OpenFDO

Authors Kai Salomaa

Publication date 16 May 1993

zbMATH Keywords

confluenceground confluencemonadic term rewriting systems

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Decidability of confluence and termination of monadic term rewriting systems
• On ground-confluence of term rewriting systems
• Foundations of Software Science and Computational Structures
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Deciding confluence of certain term rewriting systems in polynomial time

Cited in

(7)

• Characterizing confluence by rewrite closure and right ground term rewrite systems
• Confluence of curried term-rewriting systems
• Decidability of confluence and termination of monadic term rewriting systems
• Foundations of Software Science and Computational Structures
• Tail reduction free term rewriting systems revisited
• On ground-confluence of term rewriting systems
• Murg term rewrite systems

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