Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems

DOI10.1007/978-3-540-73449-9_15zbMath1203.68073OpenAlexW1574647262MaRDI QIDQ5432341

Eduard Huntingford, Guillem Godoy

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_15

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Some decidability results on one-pass reductions ⋮ Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems ⋮ Normalization properties for shallow TRS and innermost rewriting ⋮ Closure of Tree Automata Languages under Innermost Rewriting

This page was built for publication: Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems