论文信息 - The wreath product and its applications - 字舞流文

The wreath product and its applications

Howard Straubing

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

[2] Howard Straubing,et al. Aperiodic homomorphisms and the concatenation product of recognizable sets , 1979 .

[3] Price E. Stiffler,et al. Chapter 1. Extension of the fundamental theorem of finite semigroups , 1973 .

[4] R. McNaughton,et al. Counter-Free Automata , 1971 .

[5] Marcel Paul Schützenberger,et al. On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[6] Howard Straubing,et al. Families of recognizable sets corresponding to certain varieties of finite monoids , 1979 .

[7] Janusz A. Brzozowski,et al. Characterizations of locally testable events , 1973, Discret. Math..

[8] Howard Straubing,et al. Locally trivial categories and unambiguous concatenation , 1988 .

[9] Albert R. Meyer,et al. A Note on Star-Free Events , 1969, JACM.

[10] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.