SIMULATION OF TURING-MACHINES BY A REGULAR REWRITE RULE

被引：18

作者：

DAUCHET, M

机构：

[1] LIFL (CNRS, U.R.A. 369), University of Lille-Flanders-Artois, UFR IEEA

来源：

THEORETICAL COMPUTER SCIENCE | 1992年 / 103卷 / 02期

关键词：

D O I：

10.1016/0304-3975(92)90022-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We prove that for any Turing machine, there exists a regular (i.e. left-linear and nonoverlapping, also called orthogonal) and variable-preserving rule that simulates its behaviour. The main corollary is the undecidability of termination for such a rule.

引用

页码：409 / 420

页数：12

共 50 条

[1] SIMULATION OF TURING-MACHINES BY A LEFT-LINEAR REWRITE RULE
DAUCHET, M
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 109 - 120
[2] TURING-MACHINES
HOPCROFT, JE
[J]. SCIENTIFIC AMERICAN, 1984, 250 (05) : 86 - &
[3] TURING-MACHINES AND THE ENTSCHEIDUNGSPROBLEM
BUCHI, JR
[J]. MATHEMATISCHE ANNALEN, 1962, 148 (03) : 201 - 213
[4] FAST SIMULATION OF TURING-MACHINES BY RANDOM-ACCESS MACHINES
KATAJAINEN, J
VANLEEUWEN, J
PENTTONEN, M
[J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (01) : 77 - 88
[5] LINEAR-TIME SIMULATION OF MULTIHEAD TURING-MACHINES
SCHNITZLEIN, W
STOSS, HJ
[J]. INFORMATION AND COMPUTATION, 1989, 81 (03) : 353 - 363
[6] SPACE-BOUNDED SIMULATION OF MULTITAPE TURING-MACHINES
ADLEMAN, LM
LOUI, MC
[J]. MATHEMATICAL SYSTEMS THEORY, 1981, 14 (03): : 215 - 222
[7] AUTOMATED MODELS OF TURING-MACHINES
ZAKHAROV, VA
[J]. DOKLADY AKADEMII NAUK SSSR, 1986, 291 (02): : 280 - 284
[8] UNIVERSAL LIMIT TURING-MACHINES
BURGIN, MS
[J]. DOKLADY AKADEMII NAUK, 1992, 325 (04) : 654 - 658
[9] REPRESENTING THE KNOWLEDGE OF TURING-MACHINES
SHIN, HS
WILLIAMSON, T
[J]. THEORY AND DECISION, 1994, 37 (01) : 125 - 146
[10] RECONCILING OO WITH TURING-MACHINES
BERRISFORD, G
BURROWS, M
[J]. COMPUTER JOURNAL, 1994, 37 (10): : 888 - 906

← 1 2 3 4 5 →