Simplicity of algebras requires to investigate almost all operations
Demlová, Marie ; Demel, Jiří ; Koubek, Václav
Commentationes Mathematicae Universitatis Carolinae, Tome 023 (1982), p. 325-335 / Harvested from Czech Digital Mathematics Library
Publié le : 1982-01-01
Classification:  03C05,  03D15,  08A05,  08A30,  08A99
@article{106155,
     author = {Marie Demlov\'a and Ji\v r\'\i\ Demel and V\'aclav Koubek},
     title = {Simplicity of algebras requires to investigate almost all operations},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     volume = {023},
     year = {1982},
     pages = {325-335},
     zbl = {0518.08001},
     mrnumber = {664977},
     language = {en},
     url = {http://dml.mathdoc.fr/item/106155}
}
Demlová, Marie; Demel, Jiří; Koubek, Václav. Simplicity of algebras requires to investigate almost all operations. Commentationes Mathematicae Universitatis Carolinae, Tome 023 (1982) pp. 325-335. http://gdmltest.u-ga.fr/item/106155/

A. V. Aho J. E. Hopcroft J. D. Ullman The design and analysis of computer algorithms, Addison-Wesley, 1974. (1974) | MR 0413592

M. Demlová J. Demel V. Koubek On subdirectly irreducible automata, to appear in RAIRO. | MR 0610944

M. Demlová J. Demel V. Koubek Several algorithms for finite algebras, Fundamentals of Computer Theory, FCT'79, 1979, 99-104. (1979) | MR 0563663

M. Demlová J. Demel V. Koubek Algorithms deciding subdirect irreducibility of algebras, to appear.

G. Grätzer Universal algebra, Princeton, Van Nostrand and co., Inc., 1968. (1968) | MR 0248066