Previous |  Up |  Next

Article

Title: Simplicity of algebras requires to investigate almost all operations (English)
Author: Demlová, M.
Author: Demel, Jiří
Author: Koubek, Václav
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 23
Issue: 2
Year: 1982
Pages: 325-335
.
Category: math
.
MSC: 03C05
MSC: 03D15
MSC: 08A05
MSC: 08A30
MSC: 08A99
idZBL: Zbl 0518.08001
idMR: MR664977
.
Date available: 2008-06-05T21:11:42Z
Last updated: 2012-04-28
Stable URL: http://hdl.handle.net/10338.dmlcz/106155
.
Reference: [1] A. V. AHO J. E. HOPCROFT J. D. ULLMAN: The design and analysis of computer algorithms.Addison-Wesley, 1974. MR 0413592
Reference: [2] M. DEMLOVÁ J. DEMEL V. KOUBEK: On subdirectly irreducible automata.to appear in RAIRO. MR 0610944
Reference: [3] M. DEMLOVÁ J. DEMEL V. KOUBEK: Several algorithms for finite algebras.Fundamentals of Computer Theory, FCT'79, 1979, 99-104. MR 0563663
Reference: [4] M. DEMLOVÁ J. DEMEL V. KOUBEK: Algorithms deciding subdirect irreducibility of algebras.to appear.
Reference: [5] G. GRÄTZER: Universal algebra.Princeton, Van Nostrand and co., Inc., 1968. MR 0248066
.

Files

Files Size Format View
CommentatMathUnivCarol_023-1982-2_9.pdf 776.3Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo