The Parallel Complexity of Deterministic and Probabilistic Automata

A deterministic (probabilistic) automaton is said to be in TC0 whenever its transitions (stochastic event) can be computed by threshold circuits of polynomial size and constant depth. Here, we prove that: • The class of deterministic automata in TC0 is closed under homomorphism, sub-automaton, and α0-product operations. • The class of k-state deterministic (probabilistic) automata is contained in TC0 if and only if k ≤ 4 (k ≤ 2), unless TC0 = NC1. Moreover, the possibility of ranking regular languages in TC0 is related to the group-structure of their syntactic monoid.

[1]  Ingo Wegener,et al.  Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions , 1993, Inf. Process. Lett..

[2]  Azaria Paz,et al.  Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .

[3]  Carlo Mereghetti,et al.  Threshold circuits for iterated matrix product and powering , 2000, RAIRO Theor. Informatics Appl..

[4]  Dung T. Huynh,et al.  Effective Entropies and Data Compression , 1991, Inf. Comput..

[5]  J. Rhodes,et al.  Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines , 1965 .

[6]  Andrew V. Goldberg,et al.  Compression and Ranking , 1991, SIAM J. Comput..

[7]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[8]  Zoltán Ésik,et al.  Results on Homomorphic Realization of Automata by alpha_0-Products , 1991, Theor. Comput. Sci..

[9]  Dung T. Huynh.  Efficient Detectors and Constructors for Single Languages , 1991, Int. J. Found. Comput. Sci..

[10]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[11]  Alon Orlitsky,et al.  Neural Models and Spectral Methods , 1994 .

[12]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[13]  Alberto Bertoni,et al.  Ranking and Formal Power Series , 1991, Theor. Comput. Sci..

[14]  Howard Straubing,et al.  Regular Languages in NC¹ , 1992, J. Comput. Syst. Sci..

[15]  Ferenc Gécseg,et al.  Products of Automata , 1986, EATCS Monographs in Theoretical Computer Science.

[16]  Thomas Hofmeister,et al.  Depth-Efficient Threshold Circuits for Arithmetic Functions , 1994 .

[17]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .