Jakubíková, Danica Systems of unary algebras with common endomorphisms. I, II. (English) Zbl 0401.08010 Czech. Math. J. 29(104), 406-420, 421-429 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 10 Documents MSC: 08A60 Unary algebras 08A35 Automorphisms and endomorphisms of algebraic structures Keywords:unary algebra; monounary algebra; permutable mappings; endomorphism; connected components PDF BibTeX XML Cite \textit{D. Jakubíková}, Czech. Math. J. 29(104), 406--420, 421--429 (1979; Zbl 0401.08010) Full Text: EuDML OpenURL References: [1] W. Bartol: Algebraic complexity of machines. Bull. Acad. Polon. Sci., Sér. Sci. Math., Astr., Phys., 22 (1974), 851-856. · Zbl 0298.68041 [2] М. Гавалец Д. Якубикова: О ширине категории моноунарных алгебр. Math. Slov. 28 (1978), 263-276. · Zbl 1234.93001 [3] Д. Якубикова: Гомоморфизмы унарных алгебр. Math. Slov. 26 (1976), 317-322. · Zbl 1170.01332 [4] B. Jónsson: Topics in universal algebra. Berlin 1972. · Zbl 0225.08001 [5] O. Kopeček M. Novotný: On some invariants of unary algebras. Czech. Math, J. 24 (99), (1974), 219-246. [6] M. Novotný: On a problem of the theory of mappings. (Czech), Publ. Fac. Sci. Univ. Masaryk, No 344 (1953), 53-64. [7] M. Novotný: Über Abbildungen von Mengen. Pacif. J. Math., 13 (1963), 1359-1369. · Zbl 0137.25304 [8] M. Novotný: Construction of all homomorphisms of unary algebras. (Czech), Katedra matematiky pedagogické fakulty UJEP, Seminář o nových směrech ve vyučování matematice, Brno,1973. [9] L. A. Skornjakov: Unars. Colloquium on universal algebra, Esztergom, 1977, 133-136. · Zbl 0376.08004 [10] И. Жемберы: Характеризация операций в алгебрах при помош;и частично упорядоченных множеств. Matem. časopis 24 (1974), 277-282. · Zbl 1170.01350 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.