최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기초록이 없습니다.
J. Berstel 1985 Theory of Codes Berstel J., Perrin D., “Theory of Codes”, Academic Press, Inc., New York, 1985.
Boë J. M., “Représentation des Monoïdes. Applications à la Théorie des codes”, Thèse, Univ. du Languedoc, 1976.
Theoretical Computer Science J. M. Boë 81 17 1991 10.1016/0304-3975(91)90313-Q Boë J. M.,Les Boîtes, Theoretical Computer Science81 (1991), 17-34.
Theoretical Computer Science A. Carpi 51 215 1987 10.1016/0304-3975(87)90055-7 Carpi A.,On unambiguous reductions of monoids of unambiguous relations, Theoretical Computer Science51 (1987), 215-220.
Theoretical Computer Science A. Carpi 60 285 1988 10.1016/0304-3975(88)90114-4 Carpi A.,On synchronizing unambiguous automata, Theoretical Computer Science,60 (1988), 285-296.
K. H. Kim 1982 Boolean Matrix Theory and Applications Kim K. H., “Boolean Matrix Theory and Applications”, Marcel Dekker, Inc., New York, 1982.
Konieczny J., “Semigroups of Binary Relations”, Ph.D. Thesis, Pennsylvania State Univ. of, 1992.
Semigroup Forum E. Rest Le 21 167 1980 10.1007/BF02572547 Le Rest E., Le Rest M.,Une représentation fidèle des groupes d’un monoïde de relations binaires sur un ensemble fini, Semigroup Forum21 (1980), 167-172.
Pacific Jour. of Math. R. J. Plemmons 35 743 1970 10.2140/pjm.1970.35.743 Plemmons R. J., West M. T.,On the semigroup of binary relations, Pacific Jour. of Math.35 (1970) 743-753.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.