Termination of Rewriting with Right-Flat Rules

DOI10.1007/978-3-540-73449-9_16zbMath1203.68074OpenAlexW1521422367MaRDI QIDQ5432342

Eduard Huntingford, Guillem Godoy, Ashish Kumar Tiwari

Publication date: 2 January 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_16

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification ⋮ Closure of Tree Automata Languages under Innermost Rewriting ⋮ Undecidable properties of flat term rewrite systems ⋮ Unique Normalization for Shallow TRS ⋮ Non-linear rewrite closure and weak normalization ⋮ Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

This page was built for publication: Termination of Rewriting with Right-Flat Rules