Testing of properties of finite algebras

  • A. Goralčíková
  • P. Goralčík
  • V. Koubek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.Google Scholar
  2. [2]
    G. Birkhoff, Lattice Theory, Amer. Math. Soc. vol. XXV (1967).Google Scholar
  3. [3]
    A. H. Clifford, G. B. Preston, The Algebraic Theory of Semigroups Amer. Math. Soc. Math. Surveys 7 (1964).Google Scholar
  4. [4]
    M. Demlová, J. Demel, V. Koubek, Several Algorithms for Finite Algebras, Proceedings of FCT'79, Akademie-Verlag, Berlin (1979), 99–104.Google Scholar
  5. [5]
    A. Goralčíková, V. Koubek, A Reduct — and — Closure Algorithms for Graphs, Proceedings of MFCS '79, Springer-Verlag Berlin, Heidelberg, New York (1979), 301–307Google Scholar
  6. [6]
    L. Ja. Kulikov, On Abelian Groups of an Arbitrary Cardinality, Mat. Sbornik 9(1941), 165–182 (in Russian).Google Scholar
  7. [7]
    B. M. Schein, On Subdirectly Irreducible Semigroups, Doklady, 144(1962), 999–1002 (in Russian).Google Scholar
  8. [8]
    R. E. Tarjan, Determining Whether a Groupoid Is a Group, Inf. Proc. Letters 1(1972), 120–124.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • A. Goralčíková
    • 1
  • P. Goralčík
    • 1
  • V. Koubek
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles University, PraguePraha 1Czechoslovakia

Personalised recommendations