http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Remarks on Four-Dimensional Probabilistic Finite Automata
Makoto Sakamoto,Yasuo Uchida,Makoto Nagatomo,Tuo Zhang,Hikaru Susaki,Takao Ito,Tsunehiro Yoshinaga,Satoshi Ikeda,Masahiro Yokomichi,Hiroshi Furutani 보안공학연구지원센터 2015 International Journal of Software Engineering and Vol.9 No.4
This paper deals with the study of four-dimensional automata. Recently, due to the advances in many application areas such as dynamic image processing, computer animation, augmented reality (AR), and so on, it is useful for analyzing computation of four-dimensional information processing (three-dimensional pattern processing with time axis) to explicate the properties of four-dimensional automata. From this point of view, we have investigated many properties of four-dimensional automata and computational complexity. On the other hand, the class of sets accepted by probabilistic machines have been studied extensively. As far as we know, however, there is no results concerned with four-dimensional probabilistic machines. In this paper, we introduce four-dimensional probabilistic finite automata, and investigate some accepting powers of them.
Remarks on Four-Dimensional Probabilistic Finite Automata
Makoto Sakamoto,Yasuo Uchida,Makoto Nagatomo,Tuo Zhang,Hikaru Susaki,Takao Ito,Tsunehiro Yoshinaga,Satoshi Ikeda,Masahiro Yokomichi,Hiroshi Furutani 보안공학연구지원센터 2015 International Journal of Software Engineering and Vol.9 No.6
This paper deals with the study of four-dimensional automata. Recently, due to the advances in many application areas such as dynamic image processing, computer animation, augmented reality (AR), and so on, it is useful for analyzing computation of four-dimensional information processing (three-dimensional pattern processing with time axis) to explicate the properties of four-dimensional automata. From this point of view, we have investigated many properties of four-dimensional automata and computational complexity. On the other hand, the class of sets accepted by probabilistic machines have been studied extensively. As far as we know, however, there is no results concerned with four-dimensional probabilistic machines. In this paper, we introduce four-dimensional probabilistic finite automata, and investigate some accepting powers of them.