论文信息 - An ergodic theorem for read-once non-uniform deterministic finite automata - 字舞流文

An ergodic theorem for read-once non-uniform deterministic finite automata

Alexander Russell | Denis Thérien | Mikael Goldmann | A. Russell | M. Goldmann | D. Thérien

[1] Howard Straubing,et al. Superlinear Lower Bounds for Bounded-Width Branching Programs , 1995, J. Comput. Syst. Sci..

[2] D. M. Barrington,et al. Finite monoids and the fine structure of NC1 , 1988, JACM.

[3] D. A. Barrington. BOUNDED WIDTH BRANCHING PROGRAMS , 1986 .

[4] P. Diaconis,et al. Generating a random permutation with random transpositions , 1981 .