Termination modulo equations by abstract commutation with an application to iteration

DOI10.1016/S0304-3975(96)00254-XzbMath0901.68090OpenAlexW1978137006MaRDI QIDQ1391793

Hans Zantema, W. J. Fokkink

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00254-x

zbMATH Keywords

process algebraterm rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

A complete equational axiomatization for MPA with string iteration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination by completion
• A complete inference system for a class of regular behaviours
• Algebra of communicating processes with abstraction
• Termination orderings for associative-commutative rewriting systems
• Associative-commutative reduction orderings
• Termination of term rewriting: Interpretation and type elimination
• A complete equational axiomatization for prefix iteration
• An equational axiomatization for multi-exit iteration
• Total termination of term rewriting
• Axiomatizing prefix iteration with silent steps
• Process algebra for synchronous communication
• A complete characterization of termination of 0p 1q→1r 0s
• Dummy elimination in equational rewriting
• Dummy elimination: Making termination easier
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Path orderings for termination of associative-commutative rewriting

This page was built for publication: Termination modulo equations by abstract commutation with an application to iteration