- Higher-order rewrite systems and their confluence Richard Mayr Tobias Nipkow Mon 18 February 2013
- On Families of Graphs Having a Decidable First Order Theory with Reachability Thomas Colcombet Wed 17 October 2012
- On the Connections between Rewriting and Formal Language Theory Friedrich Otto Mon 15 October 2012
- Formal Languages and Word-Rewriting Géraud Sénizergues Wed 03 October 2012
- Linear context-free rewriting systems and deterministic tree-walking transducers David J. Weir 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
- Tree Automata Techniques and Applications H. Comon M. Dauchet R. Gilleron C. Løding F. Jacquemard D. Lugiez S. Tison M. Tommasi 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
- A property which guarantees termination in weak combinatory logic and subtree replacement systems Alberto Pettorossi Fri 24 August 2012
- Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems Alberto Pettorossi Fri 24 August 2012
- Termination of rewriting Nachum Dershowitz Mon 14 May 2012
Library Size: 13G (13 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
