Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras

Jiří Demel

Kybernetika (1982)

  • Volume: 18, Issue: 2, page 121-130
  • ISSN: 0023-5954

How to cite

top

Demel, Jiří. "Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras." Kybernetika 18.2 (1982): 121-130. <http://eudml.org/doc/27611>.

@article{Demel1982,
author = {Demel, Jiří},
journal = {Kybernetika},
keywords = {time complexity; algorithms; subdirect reduction of finite algebras; maximal congruence; subdirectly irreducible algebras; subdirect product},
language = {eng},
number = {2},
pages = {121-130},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras},
url = {http://eudml.org/doc/27611},
volume = {18},
year = {1982},
}

TY - JOUR
AU - Demel, Jiří
TI - Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras
JO - Kybernetika
PY - 1982
PB - Institute of Information Theory and Automation AS CR
VL - 18
IS - 2
SP - 121
EP - 130
LA - eng
KW - time complexity; algorithms; subdirect reduction of finite algebras; maximal congruence; subdirectly irreducible algebras; subdirect product
UR - http://eudml.org/doc/27611
ER -

References

top
  1. A. V. Aho J. E. Hopcroft J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts 1974. (1974) MR0413592
  2. G. Birkhoff, Subdirect unions in universal algebra, Bull. Amer. Math. Soc. 50 (1944), 764-768. (1944) Zbl0060.05809MR0010542
  3. M. Demlová J. Demel V. Koubek, On subdirectly irreducible automata, RAIRO Inform. Theor. 15 (1981), 23-46. (1981) MR0610944
  4. M. Demlová J. Demel V. Koubek, Several algorithms for finite algebras, In: Fundamentals of Computation Theory 1979 (L. Budach, ed.), Akademie-Verlag, Berlin 1979, 99-104. (1979) MR0563663
  5. M. Demlová J. Demel V. Koubek, Algorithms constructing minimal objects in algebras, (to appear). 
  6. G. Grätzer, Universal Algebra, D. Van Nostrand Company, Princeton, N.J. 1968. (1968) MR0248066
  7. J. Hartmanis R. E. Stearns, Algebraic Structure Theory of Sequential Machines, Prentice-Hall Inc., Englewood Cliffs, N.J. 1966. (1966) MR0204224
  8. J. E. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, In: Theory of Machines and Computations (Z. Kohavi, A. Paz, eds.), Academic Press, New York 1971, 189-196. (1971) MR0403320
  9. J. E. Hopcroft R. M. Karp, An Algorithm for Testing the Equivalence of Finite Automata, TR-71-114. Dept. of Computer Science, Cornell University, Ithaca, N.Y. 1971. (1971) 
  10. R. E. Tarjan, Efficiency of a good but not linear disjoint set union algorithm, J. Assoc. Comput. Mach. 22 (1975), 215-225. (1975) MR0458996
  11. R. E. Tarjan, Reference machines require non-linear time to maintain disjoint sets, Proc. 9th Annual ACM Symposium on Theory of Computing, Boulder, Colorado 1977, 18-29. (1977) MR0483682

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.