Remarks on Four-Dimensional Probabilistic Finite Automata

This paper is a 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.

[1]  Makoto Sakamoto,et al.  Hierarchies Based On the Number of Cooperating Systems of Finite Automata on Four-Dimensional Input Tapes , 2012 .

[2]  Katsushi Inoue,et al.  Nonclosure Properties of Two-Dimensional One-Marker Automata , 1997, Int. J. Pattern Recognit. Artif. Intell..

[3]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[4]  M. Blum,et al.  Automata on a 2-Dimensional Tape , 1967, SWAT.

[5]  Jie Wang,et al.  A Note on Two-Way Probabilistic Automata , 1992, Inf. Process. Lett..

[6]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.

[7]  Makoto Sakamoto,et al.  Synchronized alternating turing machines on four-dimensional input tapes , 2010 .

[8]  Pascal Michel,et al.  A Survey of Space Complexity , 1992, Theor. Comput. Sci..

[9]  Janis Kaneps.  Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata , 1991, FCT.

[10]  Ioan I. Macarie.  Multihead Two-Way probabilistic Finite Automata , 1995, LATIN.

[11]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[12]  坂本眞人.  Three-Dimensional Alternating Turing Machines , 1999 .

[13]  Katsushi Inoue,et al.  A Note on Two-Dimensional Probabilistic Finite Automata , 1998, Inf. Sci..

[14]  Makoto Sakamoto,et al.  A Relationship between Marker and Inkdot for Four-Dimensional Automata , 2010 .

[15]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[16]  Rani Siromoney,et al.  Picture Languages with Array Rewriting Rules , 1973, Inf. Control..

[17]  Marek Karpinski,et al.  On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes , 1987, Inf. Comput..

[18]  Katsushi Inoue,et al.  Closure Properties of the Classes of Sets Recognized by Space-Bounded Two-Dimensional Probabilistic Turing Machines , 1999, Inf. Sci..

[19]  Katsushi Inoue,et al.  Two-Dimensional Alternating Turing Machines , 1983, Theor. Comput. Sci..

[21]  Gerd Folkers,et al.  On computable numbers , 2016 .

[22]  Albert G. Greenberg,et al.  A Lower Bound for Probabilistic Algorithms for Finite State Machines , 1984, J. Comput. Syst. Sci..

[23]  Jeffrey D. Ullman,et al.  Some Results on Tape-Bounded Turing Machines , 1969, JACM.

[24]  Makoto Sakamoto,et al.  Hierarchy Based on Configuration-Reader about k-Neighborhood Template A-Type Three-Dimensional Bounded Cellular Acceptor , 2014, J. Robotics Netw. Artif. Life.

[25]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[26]  Azriel Rosenfeld,et al.  Picture languages: Formal models for picture recognition , 1979 .

[27]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[28]  Katsushi Inoue,et al.  A survey of two-dimensional automata theory , 1991, Inf. Sci..

[29]  Katsushi Inoue,et al.  Two-dimensional alternating Turing machines , 1982, STOC '82.

[30]  Makoto SAKAMOTO,et al.  A Note on Four-Dimensional Finite Automata , 2004 .

[31]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[32]  Katsushi Inoue,et al.  Cyclic closure properties of automata on a two-dimensional tape , 1978, Inf. Sci..

[33]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[34]  Katsushi Inoue,et al.  A Note on Two-Dimensional Finite Automata , 1978, Inf. Process. Lett..

[35]  Rusins Freivalds,et al.  Probabilistic Two-Way Machines , 1981, MFCS.