ON A STABLE GENERATING OF RANDOM SEQUENCES BY PROBABILISTIC-AUTOMATA

被引：0

|

作者：

ALPIN, JA

KOTCHKAREV, BS

MUBARAKZIANOV, RG

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1987年 / 278卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：17 / 20

页数：4

相关论文

共 50 条

[1] PROBABILISTIC-AUTOMATA AND SIMULATION
YAROVITSKII, NV
KOSTINA, NI
[J]. CYBERNETICS AND SYSTEMS ANALYSIS, 1993, 29 (03) : 321 - 329
[2] THE EQUIVALENCE AND LEARNING OF PROBABILISTIC-AUTOMATA
TZENG, WG
[J]. 30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 268 - 273
[3] PROBABILISTIC-AUTOMATA AS A MODEL FOR EPIGENESIS OF CELLULAR NETWORKS
MILGRAM, M
ATLAN, H
[J]. JOURNAL OF THEORETICAL BIOLOGY, 1983, 103 (04) : 523 - 547
[4] A NOTE ON 2-WAY PROBABILISTIC-AUTOMATA
WANG, J
[J]. INFORMATION PROCESSING LETTERS, 1992, 43 (06) : 321 - 326
[5] COMPARATIVE COMPLEXITY OF THE REPRESENTATION OF LANGUAGES BY PROBABILISTIC-AUTOMATA
ABLAEV, FM
[J]. CYBERNETICS, 1989, 25 (03): : 311 - 316
[6] THE COMPLEXITY PROPERTIES OF PROBABILISTIC-AUTOMATA WITH ISOLATED CUT POINT
ABLYV, FM
[J]. THEORETICAL COMPUTER SCIENCE, 1988, 57 (01) : 87 - 95
[7] THE INCREASE IN THE NUMBER OF STATES IN DETERMINIZATION OF FINITE PROBABILISTIC-AUTOMATA
FREJVALD, RV
[J]. AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1982, (03): : 39 - 42
[8] ON THE COMPUTATIONAL-COMPLEXITY OF APPROXIMATING DISTRIBUTIONS BY PROBABILISTIC-AUTOMATA
ABE, N
WARMUTH, MK
[J]. MACHINE LEARNING, 1992, 9 (2-3) : 205 - 260
[9] A POLYNOMIAL-TIME ALGORITHM FOR THE EQUIVALENCE OF PROBABILISTIC-AUTOMATA
TZENG, WG
[J]. SIAM JOURNAL ON COMPUTING, 1992, 21 (02) : 216 - 227
[10] APPLICATION OF GROWING PROBABILISTIC-AUTOMATA FOR MATHEMATICAL-MODELING
MATSEVITYI, LV
[J]. CYBERNETICS, 1989, 25 (01): : 111 - 114

← 1 2 3 4 5 →