Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent

DOI10.1016/j.ipl.2010.06.015zbMath1234.68185OpenAlexW2167541995MaRDI QIDQ407556

Masahiko Sakai, Mizuhito Ogawa

Publication date: 27 March 2012

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

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

zbMATH Keywords

confluenceformal languagesterm rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (max. 100)

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Undecidable Properties on Length-Two String Rewriting Systems
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
• Development closed critical pairs
• The Confluence Problem for Flat TRSs
• Computer Science Logic
• Tree-Manipulating Systems and Church-Rosser Theorems
• Confluence without termination via parallel critical pairs

This page was built for publication: Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent