| Title:
|
Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras (English) |
| Author:
|
Demel, Jiří |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
18 |
| Issue:
|
2 |
| Year:
|
1982 |
| Pages:
|
121-130 |
| . |
| Category:
|
math |
| . |
| MSC:
|
08-04 |
| MSC:
|
08A30 |
| MSC:
|
68C05 |
| MSC:
|
68D37 |
| MSC:
|
68Q25 |
| idZBL:
|
Zbl 0486.08003 |
| idMR:
|
MR679784 |
| . |
| Date available:
|
2009-09-24T17:26:50Z |
| Last updated:
|
2012-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/124456 |
| . |
| Reference:
|
[1] A. V. Aho J. E. Hopcroft J. D. Ullman: The Design and Analysis of Computer Algorithms.Addison-Wesley, Reading, Massachusetts 1974. MR 0413592 |
| Reference:
|
[2] G. Birkhoff: Subdirect unions in universal algebra.Bull. Amer. Math. Soc. 50 (1944), 764-768. Zbl 0060.05809, MR 0010542 |
| Reference:
|
[3] M. Demlová J. Demel V. Koubek: On subdirectly irreducible automata.RAIRO Inform. Theor. 15 (1981), 23-46. MR 0610944 |
| Reference:
|
[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. MR 0563663 |
| Reference:
|
[5] M. Demlová J. Demel V. Koubek: Algorithms constructing minimal objects in algebras.(to appear). |
| Reference:
|
[6] G. Grätzer: Universal Algebra.D. Van Nostrand Company, Princeton, N.J. 1968. MR 0248066 |
| Reference:
|
[7] J. Hartmanis R. E. Stearns: Algebraic Structure Theory of Sequential Machines.Prentice-Hall Inc., Englewood Cliffs, N.J. 1966. MR 0204224 |
| Reference:
|
[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. MR 0403320 |
| Reference:
|
[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. |
| Reference:
|
[10] R. E. Tarjan: Efficiency of a good but not linear disjoint set union algorithm.J. Assoc. Comput. Mach. 22 (1975), 215-225. MR 0458996 |
| Reference:
|
[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. MR 0483682 |
| . |
