- On the property of preserving regularity for string-rewriting systems Friedrich Otto Tue 25 February 2014
- Losing Recognizability Sándor Vágvølgyi Thu 16 January 2014
- Reachability Analysis over Term Rewriting Systems Guillaume Feuillade Thomas Genet Valérie Viet Triem Tong Wed 15 January 2014
- Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability Toshinori Takai Yuichi Kaji Hiroyuki Seki Fri 10 January 2014
- The regular viewpoint on PA-processes D. Lugiez Ph. Schnoebelen Tue 27 November 2012
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphs Javier Esparza Andreas Podelski Tue 27 November 2012
- Visibly Pushdown Languages and Term Rewriting Jacques Chabin Pierre Réty Thu 11 October 2012
- On relationship between term rewriting systems and regular tree languages G.A. Kucherov Wed 03 October 2012
- On Regularity-Preservation by String-Rewriting Systems Peter Leupold Wed 03 October 2012
- Some undecidability results concerning the property of preserving regularity Friedrich Otto Tue 02 October 2012
- Bottom-up rewriting is inverse recognizability preserving Irène Durand Géraud Sénizergues Mon 01 October 2012
- Bottom-up rewriting for words and terms Irene Durand Geraud Senizergues Mon 01 October 2012
- Regular Tree Languages and Rewrite Systems Rémi Gilleron Sophie Tison Mon 01 October 2012
- Preserving Regularity and Related Properties of String-Rewriting Systems Friedrich Otto Fri 28 September 2012
- Reachability Problems on Regular Ground Tree Rewriting Graphs Christof Løding Fri 28 September 2012
- Closure of Tree Automata Languages under Innermost Rewriting Adrià Gascón Guillem Godoy Florent Jacquemard Fri 28 September 2012
Library Size: 13G (16 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
