RESTRICTIONS OF CONGRUENCES GENERATED BY FINITE CANONICAL STRING-REWRITING SYSTEMS

被引：0

作者：

OTTO, F ^{[1
]}

机构：

[1] SUNY ALBANY, DEPT COMP SCI, ALBANY, NY 12222 USA

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 355卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：359 / 370

页数：12

共 50 条

[1] Disjointness of Congruences generated by Finite Monadic String-Rewriting Systems that are Confluent is Undecidable in General
Otto, F.
[J]. Bulletin of the European Association for Theoretical Computer Science, (64):
[2] FINITE CANONICAL REWRITING-SYSTEMS FOR CONGRUENCES GENERATED BY CONCURRENCY RELATIONS
OTTO, F
[J]. MATHEMATICAL SYSTEMS THEORY, 1987, 20 (04): : 253 - 260
[3] CODES MODULO FINITE MONADIC STRING-REWRITING SYSTEMS
OTTO, F
NARENDRAN, P
[J]. THEORETICAL COMPUTER SCIENCE, 1994, 134 (01) : 175 - 188
[4] SOME PROPERTIES OF FINITE SPECIAL STRING-REWRITING SYSTEMS
ZHANG, LX
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 1992, 14 (04) : 359 - 369
[5] Observation of string-rewriting systems
Cavaliere, Matteo
Leupold, Peter
[J]. FUNDAMENTA INFORMATICAE, 2006, 74 (04) : 447 - 462
[6] Monoid presentations of groups by finite special string-rewriting systems
Parkes, DW
Shavrukov, VY
Thomas, RM
[J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2004, 38 (03): : 245 - 256
[7] ON DECIDING CONFLUENCE OF FINITE STRING-REWRITING SYSTEMS MODULO PARTIAL COMMUTATIVITY
OTTO, F
[J]. THEORETICAL COMPUTER SCIENCE, 1989, 67 (01) : 19 - 35
[8] ABOUT THE DESCRIPTIVE POWER OF CERTAIN CLASSES OF FINITE STRING-REWRITING SYSTEMS
MADLENER, K
OTTO, F
[J]. THEORETICAL COMPUTER SCIENCE, 1989, 67 (2-3) : 143 - 172
[9] On Regularity-Preservation by String-Rewriting Systems
Leupold, Peter
[J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2008, 5196 : 345 - 356
[10] On the property of preserving regularity for string-rewriting systems
Otto, F
[J]. REWRITING TECHNIQUES AND APPLICATIONS, 1997, 1232 : 83 - 97

← 1 2 3 4 5 →