Non-linear rewrite closure and weak normalization

DOI10.1007/S10817-012-9262-5zbMath1314.68171OpenAlexW2068799509MaRDI QIDQ2351264

Guillem Godoy, Francesc Massanes, Carles Creus, Ashish Kumar Tiwari

Publication date: 23 June 2015

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-012-9262-5

zbMATH Keywords

weak normalizationtree automataterm rewritingrewrite closure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Non-linear rewrite closure and weak normalization

Cites Work

• Unnamed Item
• Decidability for left-linear growing term rewriting systems.
• Characterizing confluence by rewrite closure and right ground term rewrite systems
• Ground reducibility is EXPTIME-complete
• Automata for reduction properties solving
• Non-linear rewrite closure and weak normalization
• Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems
• On the Normalization and Unique Normalization Properties of Term Rewrite Systems
• Term Rewriting and All That
• Automated Reasoning
• Computer Science Logic
• Termination of Rewriting with Right-Flat Rules

This page was built for publication: Non-linear rewrite closure and weak normalization