Titlebook: Rewriting Techniques and Applications; Bordeaux, France, Ma Pierre Lescanne Conference proceedings 1987 Springer-Verlag Berlin Heidelberg 1

战胜

On equational theories, unification and decidability,t collapse free, collapse free, regular, and Ω-free theories. The relationships between the particular theories are shown and the connection between these classes and the unification hierarchy is pointed out. We give an equational theory that always has a minimal set of unifiers for single equations

薄荷醇

The word problem for finitely presented monoids and finite canonical rewriting systems,known examples of finitely presented groups that have easily decidable word problem, but that do not meet this condition, this implies that there are finitely presented monoids (and groups) with decidable word problem that cannot be presented by finite canonical rewriting systems.

POINT

Aerophagia

Combinatorial hypermap rewriting,f all connected planar maps. We also investigate a special kind of hypermap grammars, the H-grammars, for which we give a Pumping Theorem enlightening the combinatorial structure of the generated hypermap languages.