DETERMINISTIC SIMULATION OF TAPE-BOUNDED PROBABILISTIC TURING MACHINE TRANSDUCERS

被引：7

作者：

GILL, J ^{[1
]}

HUNT, J ^{[1
]}

SIMON, J ^{[1
]}

机构：

[1] UNIV CAMPINAS,DEPT C COMP,CAMPINAS 13100,SP,BRAZIL

来源：

关键词：

D O I：

10.1016/0304-3975(80)90063-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：333 / 338

页数：6

共 8 条

[1]

Csanky L., 1976, SIAM Journal on Computing, V5, P618, DOI 10.1137/0205040

[2] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J].

GILL, J .

[3]

HARTMANIS J, 1974, 15TH P SWAT, P12

[4]

Hopcroft J.E., 1969, FORMAL LANGUAGES THE

[5]

HUNT JW, 1978, THESIS STANFORD U

[6] CHARACTERIZATION OF POWER OF VECTOR MACHINES [J].

PRATT, VR ;

STOCKMEYER, LJ .

[7]

Simon J., 1978, 19th Annual Symposium on Foundations of Computer Science, P107, DOI 10.1109/SFCS.1978.27

[8]

SIMON J, UNPUBLISHED