Left-linear Bounded TRSs are Inverse Recognizability Preserving

DOI10.4230/LIPICS.RTA.2011.361zbMath1236.68126OpenAlexW2146984400MaRDI QIDQ5389094

Irène Durand, Marc Sylvestre

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_0cdf.html

zbMATH Keywords

term rewritingrewriting strategiespreservation of recognizability

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Towards more precise rewriting approximations ⋮ Symbol different term rewrite systems ⋮ Termination criteria for tree automata completion

Uses Software

• AProVE
• TORPA

This page was built for publication: Left-linear Bounded TRSs are Inverse Recognizability Preserving