共 50 条
- [2] FINITE CANONICAL REWRITING-SYSTEMS FOR CONGRUENCES GENERATED BY CONCURRENCY RELATIONS [J]. MATHEMATICAL SYSTEMS THEORY, 1987, 20 (04): : 253 - 260
- [7] PDT is undecidable for finitely presented monoids with solvable word problems [J]. FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 1997, 1279 : 388 - 399
- [8] INFINITE, CANONICAL STRING REWRITING-SYSTEMS GENERATED BY COMPLETION [J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 433 - 444
- [10] Cross-sections for finitely presented monoids with decidable word problems [J]. REWRITING TECHNIQUES AND APPLICATIONS, 1997, 1232 : 53 - 67