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

DOI10.1016/J.IPL.2010.06.015zbMATH Open1234.68185OpenAlexW2167541995MaRDI QIDQ407556FDOQ407556

Authors: 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

formal languagesconfluenceterm rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Undecidable properties on length-two string rewriting systems
• Title not available (Why is that?)
• A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
• Development closed critical pairs
• Title not available (Why is that?)
• The Confluence Problem for Flat TRSs
• Computer Science Logic
• Tree-Manipulating Systems and Church-Rosser Theorems
• Confluence without termination via parallel critical pairs

Cited In (1)

• Non-\(E\)-overlapping, weakly shallow, and non-collapsing TRSs are confluent

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407556)