The reachability and related decision problems for monadic and semi-constructor TRSs

DOI10.1016/J.IPL.2006.02.014zbMath1343.68127OpenAlexW1964897824MaRDI QIDQ844204

Ichiro Mitsuhashi, Toshiyuki Yamada, Michio Oyamaguchi

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.02.014

zbMATH Keywords

theory of computationterm rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

New Undecidability Results for Properties of Term Rewrite Systems ⋮ Murg term rewrite systems

Cites Work

• Reachability and confluence are undecidable for flat term rewriting systems
• Rewriting Techniques and Applications
• Unnamed Item

This page was built for publication: The reachability and related decision problems for monadic and semi-constructor TRSs