Decomposition of Finite Automata.

被引：0

|

作者：

Bokr, Josef ^{[1
]}

机构：

[1] Vysoka Skola Strojni a, Elektrotechnicka, Plzen, Czech, Vysoka Skola Strojni a Elektrotechnicka, Plzen, Czech

来源：

Automatizace Praha | 1986年 / 29卷 / 8-9期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

10

引用

收藏

页码：206 / 211

相关论文

共 50 条

[41] ANIMATING QUANTITATIVE MAPS WITH CELLULAR AUTOMATA.
Appel, A.
Evangelisti, C.J.
Stein, A.J.
IBM technical disclosure bulletin, 1983, 26 (3 A): : 953 - 956
[42] TWO-WAY PROBABILISTIC AUTOMATA.
Kuklin, Yu.I.
Automatic Control and Computer Sciences, 1973, 7 (05) : 29 - 31
[43] How Chemistry Computes: Language Recognition by Non-Biochemical Chemical Automata. From Finite Automata to Turing Machines
Duenas-Diez, Marta
Perez-Mercader, Juan
ISCIENCE, 2019, 19 : 514 - +
[44] APPLICATION OF KOTARBINSKI'S CONCEPTS IN THE ANALYSIS OF AUTOMATA.
Bienkowski, Kazimierz
El-Nahhas, Ossama
Archiwum Automatyki i Telemechaniki, 1976, 21 (01): : 53 - 64
[45] 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
[46] Synthesis of High-Speed Digital Automata.
Kirpichnikov, V.M.
Sklyarov, V.A.
1978, 21 (08): : 75 - 80
[47] Universal Automata. Properties and Technical Realization.
Hoppe, Juergen
Zeitschrift fur Elektrische Informations - und Energietechnik, 1974, 4 (06): : 379 - 390
[48] Potential automata. Application to the genetic code III
Demongeot, Jacques
Elena, Adrien
Weil, Georges
COMPTES RENDUS BIOLOGIES, 2006, 329 (12) : 953 - 962
[49] Pebble automata. Figures families recognition and universality
Delorme, M
Mazoyer, J
FUNDAMENTA INFORMATICAE, 2002, 52 (1-3) : 81 - 132
[50] SOME PRINCIPLES FOR ROBOTICS BASED ON GENERAL AUTOMATA.
Koenig, Eldo C.
Robotica, 1986, 4 (pt 1) : 43 - 46

← 1 2 3 4 5 →