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 条

[31] Infinite Families of Finite String Rewriting Systems and Their Confluence
Jouannaud, Jean-Pierre
Monate, Benjamin
[J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2010, 6397 : 387 - +
[32] A general theory of confluent rewriting systems for logic programming and its applications
Dix, J
Osorio, M
Zepeda, C
[J]. ANNALS OF PURE AND APPLIED LOGIC, 2001, 108 (1-3) : 153 - 188
[33] INFINITE, CANONICAL STRING REWRITING-SYSTEMS GENERATED BY COMPLETION
SATTLERKLEIN, A
[J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 433 - 444
[34] On public-key cryptosystem based on Church-Rosser string-rewriting systems (extended abstract)
Oleshchuk, VA
[J]. COMPUTING AND COMBINATORICS, 1995, 959 : 264 - 269
[35] Peg-solitaire, string rewriting systems and finite automata
Ravikumar, B
[J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 233 - 242
[36] Peg-solitaire, string rewriting systems and finite automata
Ravikumar, B
[J]. THEORETICAL COMPUTER SCIENCE, 2004, 321 (2-3) : 383 - 394
[37] Finding finite automata that certify termination of string rewriting systems
Geser, A
Hofbauer, D
Waldmann, J
Zantema, H
[J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2005, 16 (03) : 471 - 486
[38] On groups presented by inverse-closed finite confluent length-reducing rewriting systems
Elder, Murray
Piggott, Adam
[J]. JOURNAL OF ALGEBRA, 2023, 627 : 106 - 131
[39] Diffraction theory of general nondiffracting beams generated with finite-aperture systems
Carcolé, E
[J]. OPTICS COMMUNICATIONS, 2005, 246 (4-6) : 255 - 274

← 1 2 3 4 →