COMPLEXITY OF PROBABILISTIC VERSUS DETERMINISTIC AUTOMATA

被引：0

|

作者：

FREIVALDS, R

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 502卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：565 / 613

页数：49

相关论文

共 50 条

[11] THE COMPLEXITY OF CONCATENATION ON DETERMINISTIC AND ALTERNATING FINITE AUTOMATA
Hospodar, Michal
Jiraskova, Galina
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2018, 52 (2-4): : 153 - 168
[12] THE COMPUTATIONAL ADVANTAGE OF PROBABILISTIC AUTOMATA OVER DETERMINISTIC AUTOMATA IN HYPERBOLIC PLANE
Tarvid, Alexander
Freivalds, Rusins
SUMMER SOLSTICE 2011 INTERNATIONAL CONFERENCE ON DISCRETE MODELS OF COMPLEX SYSTEMS, 2012, 5 (01): : 145 - 152
[13] Quantum versus deterministic counter automata
Yamasaki, T
Kobayashi, H
Imai, H
THEORETICAL COMPUTER SCIENCE, 2005, 334 (1-3) : 275 - 297
[14] Probabilistic Deterministic Finite Automata and Recurrent Networks, Revisited
Marzen, Sarah E.
Crutchfield, James P.
ENTROPY, 2022, 24 (01)
[15] Space-efficient deterministic simulation of probabilistic automata
Macarie, II
SIAM JOURNAL ON COMPUTING, 1998, 27 (02) : 448 - 465
[16] ONE CLASS OF DETERMINISTIC AUTOMATA USED IN STRUCTURAL SYNTHESIS OF PROBABILISTIC AUTOMATA.
Lapin'sh, Ya.K.
Automatic Control and Computer Sciences, 1976, 10 (06) : 1 - 4
[17] Operational State Complexity of Deterministic Unranked Tree Automata
Piao, Xiaoxue
Salomaa, Kai
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 149 - 158
[18] On the descriptional complexity of stateless deterministic ordered restarting automata
Otto, Friedrich
Kwee, Kent
INFORMATION AND COMPUTATION, 2018, 259 : 277 - 302
[19] State Complexity of Reversals of Deterministic Finite Automata with Output
Davies, Sylvie
IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2018, 2018, 10977 : 133 - 145
[20] State Complexity of Unambiguous Operations on Deterministic Finite Automata
Jiraskova, Galina
Okhotin, Alexander
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 188 - 199

← 1 2 3 4 5 →