Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
G. Birkhoff, Lattice Theory, Amer. Math. Soc. vol. XXV (1967).
A. H. Clifford, G. B. Preston, The Algebraic Theory of Semigroups Amer. Math. Soc. Math. Surveys 7 (1964).
M. Demlová, J. Demel, V. Koubek, Several Algorithms for Finite Algebras, Proceedings of FCT'79, Akademie-Verlag, Berlin (1979), 99–104.
A. Goralčíková, V. Koubek, A Reduct — and — Closure Algorithms for Graphs, Proceedings of MFCS '79, Springer-Verlag Berlin, Heidelberg, New York (1979), 301–307
L. Ja. Kulikov, On Abelian Groups of an Arbitrary Cardinality, Mat. Sbornik 9(1941), 165–182 (in Russian).
B. M. Schein, On Subdirectly Irreducible Semigroups, Doklady, 144(1962), 999–1002 (in Russian).
R. E. Tarjan, Determining Whether a Groupoid Is a Group, Inf. Proc. Letters 1(1972), 120–124.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goralčíková, A., Goralčík, P., Koubek, V. (1980). Testing of properties of finite algebras. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_77
Download citation
DOI: https://doi.org/10.1007/3-540-10003-2_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive