Disjointness of Congruences generated by Finite Monadic String-Rewriting Systems that are Confluent is Undecidable in General

被引：0

|

作者：

Otto, F.

机构：

来源：

Bulletin of the European Association for Theoretical Computer Science | / 64期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 39 条

[1] ON WEAKLY CONFLUENT MONADIC STRING-REWRITING SYSTEMS
MADLENER, K
NARENDRAN, P
OTTO, F
ZHANG, L
[J]. THEORETICAL COMPUTER SCIENCE, 1993, 113 (01) : 119 - 165
[2] SOLVABILITY OF WORD EQUATIONS MODULE FINITE SPECIAL AND CONFLUENT STRING-REWRITING SYSTEMS IS UNDECIDABLE IN GENERAL
OTTO, F
[J]. INFORMATION PROCESSING LETTERS, 1995, 53 (05) : 237 - 242
[3] The word matching problem is undecidable for finite special string-rewriting systems that are confluent
Narendran, P
Otto, F
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 638 - 648
[4] RESTRICTIONS OF CONGRUENCES GENERATED BY FINITE CANONICAL STRING-REWRITING SYSTEMS
OTTO, F
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 359 - 370
[5] SOME UNDECIDABILITY RESULTS FOR WEAKLY CONFLUENT MONADIC STRING-REWRITING SYSTEMS
OTTO, F
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 539 : 292 - 303
[6] CODES MODULO FINITE MONADIC STRING-REWRITING SYSTEMS
OTTO, F
NARENDRAN, P
[J]. THEORETICAL COMPUTER SCIENCE, 1994, 134 (01) : 175 - 188
[7] IT IS UNDECIDABLE WHETHER A FINITE SPECIAL STRING-REWRITING SYSTEM PRESENTS A GROUP
NARENDRAN, P
ODUNLAING, C
OTTO, F
[J]. DISCRETE MATHEMATICS, 1991, 98 (02) : 153 - 159
[8] On termination of confluent one-rule string-rewriting systems
ShikishimaTsuji, K
Katsura, M
Kobayashi, Y
[J]. INFORMATION PROCESSING LETTERS, 1997, 61 (02) : 91 - 96
[9] A SPECIALIZED COMPLETION PROCEDURE FOR MONADIC STRING-REWRITING SYSTEMS PRESENTING GROUPS
MADLENER, K
NARENDRAN, P
OTTO, F
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 279 - 290
[10] DECISION-PROBLEMS FOR FINITE SPECIAL STRING-REWRITING SYSTEMS THAT ARE CONFLUENT ON SOME CONGRUENCE CLASS
OTTO, F
ZHANG, L
[J]. ACTA INFORMATICA, 1991, 28 (05) : 477 - 510

← 1 2 3 4 →