1 |
Champarnaud, J. M. and G. Hansel, "AUTOMATE, a computing package for automata and finite semigroups", Journal of Symbolic Computation, Vol.12(1991), pp.197-220.
DOI
|
2 |
Booth, K. S., "Boolean matrix multiplication using only bit operations", ACM SIGACT News, Vol.9, No.3(1977), p.23.
DOI
|
3 |
Macii, E., "A Discussion of Explicit Methods for Transitive Closure Computation Based on Matrix Multiplication", 29th Asilom Conference on Signals, Systems and Computers, Vol.2(1995), pp.799-801.
|
4 |
Rim, D. S. and J. B. Kim, "Tables of D-Classes in the semigroup B of the binary relations on a set X with n-elements", Bull. Korea Math Soc., Vol.20, No.1(1983) , pp.9-13.
|
5 |
Angluin, D., "The four Russians' algorithm for boolean matrix multiplication is optimal in its class", ACM SIGACT News, Vol.8, No.1(1976), pp.29-33.
DOI
|
6 |
Atkinson, D. M., N. Santoro, and J. Urrutia, "On the integer complexity of Boolean matrix multiplication", ACM SIGACT News, Vol.18 No.1(1986), p.53
DOI
|
7 |
Yelowitz, L., "A Note on the Transitive Closure of a Boolean Matrix", ACM SIGMOD Record, Vol.25, No.2(1978), p.30.
|
8 |
Comstock, D. R., "A note on multiplying Boolean matrices II", CACM, Vol.7 No.1 (1964), p.13.
DOI
|
9 |
Nakamura, Y. and T. Yoshimura, "A partitioning- based logic optimization method for large scale circuits with Boolean matrx", Proceedings of the 32nd ACM/IEEE conference on Design automation, (1995), pp.653-657.
|
10 |
Pratt, V. R., "The Power of Negative Thinking in Multiplying Boolean matrices", Proceedigs of the annual ACM symposium on Theory of computing, (1974), pp.80-83.
|
11 |
Yi, X. et al., "Fast Encryption for Multimedia", IEEE Transactions on Consumer Electronics, Vol.47, No.1(2001), pp.101-107.
DOI
ScienceOn
|
12 |
Howie, J. M., An Introduction to semigroup theory, Oxford University Press, 1995.
|
13 |
Froidure, V. and J. Pin, "Algorithms for computing finite semigroups", Foundations of Computational Mathematics, (1997), pp.112-126.
|
14 |
Martin, D. F., "A Boolean matrix method for the computation of linear precedence functions", CACM, Vol.15, No.6(1972), pp.448-454.
DOI
|
15 |
Wall, J. R., "Green's relations for stochastic matrices", Czechoslovak Mathematical Journal, Vol.25, No.2(1975), pp.247-260.
|
16 |
Heyworth, A., "One-Sided Noncommutative Grobner Bases with Applications to Computing Green's Relations", Journal of Algebra, Vol.242(2001), pp.401-416.
DOI
ScienceOn
|
17 |
Lee, L., "Fast context-free grammar parsing require fast Boolean matrix multiplication", JACM, Vol.49, No.1(2002), pp.1-15.
DOI
ScienceOn
|
18 |
Linton, S. A., G. Pfeiffer, E. F. Robertson, and N. Ruskuc, "Computing Transformation Semigroups", Journal of Symbolic Computation, Vol.33(2002), pp.145-162.
DOI
ScienceOn
|
19 |
한재일, "효율적인 D-클래스 계산을 위한 알고리즘", 한국IT서비스학회지, 제6권, 제1호(2007), pp.151-158.
과학기술학회마을
|
20 |
한재일, "불리언 행렬의 모노이드에서의 J관계 계산 알고리즘", 한국IT서비스학회지, 제7권, 제4호(2008), pp.221-230.
과학기술학회마을
|
21 |
김창범, 한재일, "Classifications of D-classes in the semigroup (F) of all nxn Boolean matrices over F = {0, 1}", 퍼지 및 지능시스템학회논문지, 제16권, 제3호(2006), pp.338-348.
과학기술학회마을
|
22 |
한재일, "모든 lxn, nxm, rnxk 불리언 행렬 사이의 중첩곱셈에 대한 연구", 한국IT서비스학회지, 제5권, 제1호(2006), pp.191-198.
과학기술학회마을
|
23 |
Lallement, G., Semigroups and Combinatorial Applications, John Wiley and Sons, New York, 1979.
|
24 |
Straubing, H., "The Burnside problem for semigroups of matrices", in Combinatorics on Words, Progress and Perspectives, L. J. Cummings(ed.), Academic Press, (1983), pp.279-295.
|
25 |
Simon, I., "On semigroups of matrices over the tropical semiring", Informatique Theorique et Applications, Vol.28(1994), pp.277-294.
DOI
|
26 |
Plemmons, R. J. and M. T. West, "On the semigroup of binary relations", Pacific Journal of Mathematics, Vol.35(1970), pp.743-753.
DOI
|
27 |
Lallement, G. and R. McFadden, "On the determination of Green's relations in finite transformation semigroups," Journal of Symbolic Computation, Vol.10(1990), pp.481-498.
DOI
|
28 |
Konieczny, J., "Green's equivalences in finite semigroups of binary relations", Semigroup Form, Vol.48(1994), pp.235-252.
DOI
|
29 |
Sutner, K., "Finite State Machines and Syntatic Semigroups", The Mathematica Journal, Vol.2(1991), pp.78-87.
|
30 |
Cousineau, G., J. F. Perrot, and J. M. Rifflet, "APL programs for direct computation of a finite semigroup", APL Congres, Vol.73(1973), pp.67-74.
|