It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free

von Narendran, Paliath
Veröffentlicht 1987

Any ground associative-commutative theory has a finite canonical system

von Narendran, Paliath
Veröffentlicht 1991

It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent thue system is torsion-free

von Narendran, Paliath
Veröffentlicht 1987

It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent thue system is torsion-free

von Narendran, Paliath
Veröffentlicht 1987

It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free

von Narendran, Paliath
Veröffentlicht 1987

Rewriting techniques and applications : 10th international conference ; proceedings

Veröffentlicht 1999

Rewriting techniques and applications : 10th International Conference ; RTA-99, Trento, Italy, July 2 - 4, 1999 ; proceedings

Veröffentlicht 1999

Rewriting techniques and applications : 10th international conference, RTA-99, Trento, Italy, July 2 - 4, 1999 ; proceedings

Veröffentlicht 1999

˜Aœ specialized completion procedure for monadic string-rewriting systems presenting groups

von Madlener, Klaus
Veröffentlicht 1990

Papers presented at the 10th International Conference on Rewriting Techniques and Applications : held July 2 - 4, 1999, in Trento, Italy, as part of the Federated Logic Conferenc...

Veröffentlicht 2002

Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems

von Lin, Hai
Veröffentlicht in FroCoS (13. : 2021 : Birmingham) Frontiers of Combining Systems (2021)