THE INCREASE IN THE NUMBER OF STATES IN DETERMINIZATION OF FINITE PROBABILISTIC-AUTOMATA

被引：0

|

作者：

FREJVALD, RV

机构：

来源：

AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA | 1982年 / 03期

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

收藏

页码：39 / 42

页数：4

相关论文

共 50 条

[41] REFINING ESTIMATES FOR DETERMINING NUMBER OF STATES DURING COMPOSITION OF FINITE AUTOMATA
GAVRILOV, MA
AUTOMATION AND REMOTE CONTROL, 1965, 25 (11) : 1434 - &
[42] Verification of detectability in Probabilistic Finite Automata
Keroglou, Christoforos
Hadjicostis, Christoforos N.
AUTOMATICA, 2017, 86 : 192 - 198
[43] LANGUAGES REPRESENTABLE BY FINITE PROBABILISTIC AUTOMATA
DIEU, PD
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1971, 17 (05): : 427 - &
[44] Counting with probabilistic and ultrametric finite automata
Balodis, Kaspars, 1600, Springer Verlag (8808):
[45] ITERATIVE DECOMPOSITION OF FINITE PROBABILISTIC AUTOMATA
GIORGADZE, AK
SAFIULINA, AG
AUTOMATION AND REMOTE CONTROL, 1974, 35 (09) : 1448 - 1451
[46] ADJUSTMENT EXPERIMENTS WITH FINITE PROBABILISTIC AUTOMATA
MAKAREVICH, LV
MATEVOSYAN, AA
AUTOMATION AND REMOTE CONTROL, 1972, 33 (08) : 1327 - 1330
[47] STABLE STATES OF PROBABILISTIC CELLULAR AUTOMATA
DAWSON, DA
INFORMATION AND CONTROL, 1977, 34 (02): : 93 - 106
[48] Splitting the internal states in order to reduce the number of arguments in functions of finite automata
Solov'ev, VV
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2005, 44 (05) : 777 - 783
[49] The complexity of probabilistic versus deterministic finite automata
Ambainis, A
ALGORITHMS AND COMPUTATION, 1996, 1178 : 233 - 238
[50] PROBABILISTIC EXAMINATION OF TRANSITION PROCESS IN FINITE AUTOMATA
LEVIN, VI
ENGINEERING CYBERNETICS, 1976, 14 (01): : 74 - 84

← 1 2 3 4 5 →