Simplicity of algebras requires to investigate almost all operations
Marie Demlová; Jiří Demel; Václav Koubek
Commentationes Mathematicae Universitatis Carolinae (1982)
- Volume: 023, Issue: 2, page 325-335
- ISSN: 0010-2628
Access Full Article
topHow to cite
topReferences
top- A. V. AHO J. E. HOPCROFT J. D. ULLMAN, The design and analysis of computer algorithms, Addison-Wesley, 1974. (1974) MR0413592
- M. DEMLOVÁ J. DEMEL V. KOUBEK, On subdirectly irreducible automata, to appear in RAIRO. MR0610944
- M. DEMLOVÁ J. DEMEL V. KOUBEK, Several algorithms for finite algebras, Fundamentals of Computer Theory, FCT'79, 1979, 99-104. (1979) MR0563663
- 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) MR0248066