A taxonomy of problems with fast parallel algorithms
Information and Control
Products of automata
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
The complexity of Boolean functions
The complexity of Boolean functions
Ranking and formal power series
Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
Effective entropies and data compression
Information and Computation
SIAM Journal on Computing
Results on homomorphic realization of automata by &agr;0-products
Theoretical Computer Science
Journal of Computer and System Sciences
Reduced order LQG controllers for linear time varying plants
Systems & Control Letters
Threshold circuits of bounded depth
Journal of Computer and System Sciences
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
| Hi-index | 0.00 |
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.