The number of isomorphism types of finite algebras
HTML articles powered by AMS MathViewer
- by Michael A. Harrison PDF
- Proc. Amer. Math. Soc. 17 (1966), 731-737 Request permission
References
-
W. Burnside, Theory of groups of finite order, Cambridge Univ. Press, New York, 1911.
N. G. De Bruijn, Generalization of Polya’s fundamental theorem in enumerative combinatorial analysis, Nederl. Akad. Wetensch. Proc. Ser. A 52 (1959), 59-69.
- Frank Harary, On the number of bi-colored graphs, Pacific J. Math. 8 (1958), 743–755. MR 103834
- Michael A. Harrison, A census of finite automata, Canadian J. Math. 17 (1965), 100–113. MR 170772, DOI 10.4153/CJM-1965-010-9
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 17 (1966), 731-737
- MSC: Primary 08.30
- DOI: https://doi.org/10.1090/S0002-9939-1966-0200219-9
- MathSciNet review: 0200219