Rewriting
![Arxiv:1804.04307V1 [Math.RA] 12 Apr 2018 Prtr.A Xml Fsc Lersi H Di the Di Is Algebras of Such of Example an Operators](http://data.docslib.org/img/264x/003ac2b5bab74e9b3feb1a390e9ae0ff.webp)
Top View
- LARS: a Learning Algorithm for Rewriting Systems∗
- Proving Termination of Integer Term Rewriting*
- The Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems
- Abstract Rewriting a = the Set of Nite Sequences Over ,
- Context-Free Rewriting Systems and Word-Hyperbolic Structures With
- String-Rewriting Systems Hi This Chapter We Introduce the String-Rewriting Systems and Study Their Basic Properties
- A Term-Rewriting Semantics for Imperative Style Programming David A
- Linear Higher-Order Pre-Unification
- Semi-Thue Systems and Word Problems
- On One-Rule Grid Semi-Thue Systems Michel Latteux, Yves Roos
- Termination of Graph Rewriting Systems Through Language Theory Guillaume Bonfante, Miguel Couceiro
- A Higher-Order Implementation of Rewriting
- Notes on Semi-Thue Systems in a Context of Morphogrammatics Further Explanations of the Formal Notions Behind Morphic Cellular Automata
- Braids Described As an Orthogonal Rewriting System
- An Overview of Term Rewriting Systems
- Structures for Abstract Rewriting Marc Aiguier, Diane Bahrami
- Rewriting in Varieties of Idempotent Semigroups
- Revisiting Term-Rewriting in Algebra