AbstractWe present a single-axiom. Thue system with a decidable word problem for which there does not exist any finite equivalent canonical system. However, an equivalent finite canonical system for this Thue system can be obtained if new symbols are introduced in the presentation. This result settles an open question by Jantzen (1982) who asked whether every Thue system with a decidable word problem has an equivalent finite canonical system. We also discuss relationships between Thue systems and term rewriting systems
There are well known examples of monoids in literature which do not admit a finite andcanonical pres...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
International audiencePrefixal one-rule string rewrite systems are one-rule string rewrite systems f...
AbstractWe present a single-axiom. Thue system with a decidable word problem for which there does no...
This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting ...
This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting ...
AbstractIt is well known that a monoid which is presented by a finite complete rewriting system has ...
There are well known examples of monoids in literature which do not admit a finite and canonical pre...
AbstractIt is shown that for the presentation (a, b; abbaab = λ) of the Jantzen monoid J no finite c...
AbstractA semi-Thue system S (Thue system T) is self-embedding if there exist words x, y and z such ...
AbstractWe show that there are infinitely many examples of finite semi-Thue systems with decidable w...
AbstractCertain infinite Thue systems over a finite alphabet are studied, in particular, systems S⊆∑...
The question of whether a monoid presented by a finite Thue system is cancellative is shown to be un...
AbstractHomogeneous Thue systems are considered. It is shown that if a homogeneous Thue system is no...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
There are well known examples of monoids in literature which do not admit a finite andcanonical pres...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
International audiencePrefixal one-rule string rewrite systems are one-rule string rewrite systems f...
AbstractWe present a single-axiom. Thue system with a decidable word problem for which there does no...
This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting ...
This paper is a survey of recent results on Thue systems, where the systems are viewed as rewriting ...
AbstractIt is well known that a monoid which is presented by a finite complete rewriting system has ...
There are well known examples of monoids in literature which do not admit a finite and canonical pre...
AbstractIt is shown that for the presentation (a, b; abbaab = λ) of the Jantzen monoid J no finite c...
AbstractA semi-Thue system S (Thue system T) is self-embedding if there exist words x, y and z such ...
AbstractWe show that there are infinitely many examples of finite semi-Thue systems with decidable w...
AbstractCertain infinite Thue systems over a finite alphabet are studied, in particular, systems S⊆∑...
The question of whether a monoid presented by a finite Thue system is cancellative is shown to be un...
AbstractHomogeneous Thue systems are considered. It is shown that if a homogeneous Thue system is no...
AbstractSquier (1987) showed that there exist finitely presented monoids with solvable word problem ...
There are well known examples of monoids in literature which do not admit a finite andcanonical pres...
AbstractWe present a purely combinatorial approach to the question of whether or not a finitely pres...
International audiencePrefixal one-rule string rewrite systems are one-rule string rewrite systems f...