- Regular Sets of Descendants by Some Rewrite Strategies Pierre Réty Julie Vuotto Fri 02 May 2014
- Regular Sets of Descendants by Leftmost Strategy Pierre Réty Julie Vuotto Fri 02 May 2014
- Left-linear Bounded TRSs are Inverse Recognizability Preserving Irène Durand Marc Sylvestre Fri 24 January 2014
- Decidability for Left-Linear Growing Term Rewriting Systems Takashi Nagaya Yoshihito Toyama Thu 23 January 2014
- Rewriting preserving recognizability of finite tree languages Sándor Vágvølgyi Thu 16 January 2014
Library Size: 13G (5 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
