- Bottom-up rewriting for words and terms I. Durand G. Sénizergues Thu 04 October 2018
- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property Yohei Fujinaka Mon 31 March 2014
- Termination Property of Inverse Finite Path Overlapping Term Rewriting System is Decidable Toshinori Takai Yuichi Kaji Hiroyuki Seki Fri 24 January 2014
- A Decidable Subclass of Term Rewriting Systems which Effectively Preserves Regonizability Toshinori Takai Fri 24 January 2014
- Reachability Analysis over Term Rewriting Systems Guillaume Feuillade Thomas Genet Valérie Viet Triem Tong Wed 15 January 2014
- Call by need computations in orthogonal term rewriting systems Irene Durand Wed 15 January 2014
- Termination of Linear Bounded Term Rewriting Systems Géraud Sénizergues Marc Sylvestre Irène A. Durand Wed 01 January 2014
- Some Properties of Conversion Alonzo Church J. B. Rosser Wed 27 February 2013
- On Theories with a Combinatorial Definition of Equivalence M. H. A. Newman Wed 27 February 2013
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems Gérard Huet Wed 27 February 2013
- Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence Val Tannen Jean H. Gallier Fri 26 October 2012
- Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system M. Okada Fri 26 October 2012
- On the Connections between Rewriting and Formal Language Theory Friedrich Otto Mon 15 October 2012
- Visibly Pushdown Languages and Term Rewriting Jacques Chabin Pierre Réty Thu 11 October 2012
- Widening techniques for regular tree model checking Ahmed Bouajjani Tayssir Touili Thu 11 October 2012
- The simply typed rewriting calculus Horatiu Cirstea Claude Kirchner Thu 11 October 2012
- On relationship between term rewriting systems and regular tree languages G.A. Kucherov Wed 03 October 2012
- Bottom-up tree pushdown automata: classification and connection with rewrite systems Jean-Luc Coquidé Max Dauchet Rémi Gilleron Sandor Vagvolgyi Tue 02 October 2012
- Decidable approximations of term rewriting systems Florent Jacquemard Mon 01 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
- 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
- The theory of ground rewrite systems is decidable M. Dauchet S. Tison Fri 28 September 2012
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems Max Dauchet Thierry Heuillard Pierre Lescanne Sophie Tison Fri 28 September 2012
- Proofs and reachability problem for ground rewrite systems J. Coquidé R. Gilleron Fri 28 September 2012
- Tree generating regular systems Walter S. Brainerd 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 (28 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
