About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Demlová, M. ; Demel, Jiří ; Koubek, Václav
Simplicity of algebras requires to investigate almost all operations. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 2, pp. 325-335
MSC: 03C05, 03D15, 08A05, 08A30, 08A99 | MR 664977 | Zbl 0518.08001
References:
[1] A. V. AHO J. E. HOPCROFT J. D. ULLMAN: The design and analysis of computer algorithms. Addison-Wesley, 1974. MR 0413592
[2] M. DEMLOVÁ J. DEMEL V. KOUBEK: On subdirectly irreducible automata. to appear in RAIRO. MR 0610944
[3] M. DEMLOVÁ J. DEMEL V. KOUBEK: Several algorithms for finite algebras. Fundamentals of Computer Theory, FCT'79, 1979, 99-104. MR 0563663
[4] M. DEMLOVÁ J. DEMEL V. KOUBEK: Algorithms deciding subdirect irreducibility of algebras. to appear.
[5] G. GRÄTZER: Universal algebra. Princeton, Van Nostrand and co., Inc., 1968. MR 0248066
Partner of
EuDML logo