• Journal of Information Technology Services
• /
• v.9 no.4
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.191-199
• /
• 1996

The strong shift equivalence of nonnegative integral square matrices is a necessary and sufficient condition for the topological conjugacy of topological Markov chains. In this paper we study the relation between strong shift equivalence and matrix conjugation.

• Honam Mathematical Journal
• /
• v.27 no.2
• /
• pp.163-181
• /
• 2005

We study some properties of intuitionistic fuzzy equivalence relations. Also we introduce the concepts of intuitionistic fuzzy transitive closures and level sets of an intuitionistic fuzzy relation and we investigate some of their properties.

• Communications of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.705-710
• /
• 2018

Let T(X) be the full transformation semigroup on a set X and ${\sigma}$ be an equivalence relation on X. Denote $$E(X,{\sigma})=\{{\alpha}{\in}T(X):{\forall}x,\;y{\in}X,\;(x,y){\in}{\sigma}\;\text{implies}\;x{\alpha}=y{\alpha}\}.$$. Then $E(X,{\sigma})$ is a subsemigroup of T(X). In this paper, we characterize two semigroups of type $E(X,{\sigma})$ when they are isomorphic.

• Cross-Cultural Studies
• /
• v.19
• /
• pp.251-270
• /
• 2010

The subject of the paper is to discern the validity of the translation theory put forward by the ESIT(Ecole Sup?rieur d'Interpr?tes et de Tranducteurs, Universit? Paris III) and how it differentiates from the other translation theories. First, the paper will analyze the theoretical aspects put forward by examining the equivalence that may be discerned between the french and korean translation in relation to the original english text that is being translated. Employing the equivalence in translation may shed new insights into the unterminable discussions we witness today between the literal translation and the free translation. Contrary to the formal equivalence the dynamic equivalence by Nida suggests that the messages retain the same meanings whether it be the original or a translated text to the/for the reader. In short, the object of the dynamic equivalence is to identify the closest equivalence to the suggested source language. The concept of correspondence and equivalence defined by theoriticians of translation falls to the domain of dynamic equivalence suggested by Nida. In translation theory the domain of usage of language and the that of discourse is denoted separately. by usage one denotes the translation through symbols that make up language itself. In contrast to this, the discourse is suggestive of defining the newly created expressions which may be denoted as being a creative equivalence which embodies the original message for the singular situation at hand. The translator will however find oneself incorporating the two opposing theories in translating. Translation falls under the criteria of text and not of language, thus one cannot regulate or foresee any special circumstances that may arise in translation of discourse, the translation to reflect this condition should always be delimited. All other translation should be subject to translation by equivalence. The interpretation theory in translation (of ESIT) in effect is relative to both the empirical and philosophical approach and is suggestive of new perspective in translation. In conclusion, the above suggested translation theory is different from the skopos theory and the polysystem theory in that it only takes in to account the elements that are in close relation to the original text, and also that it was developed for educational purposes opening new perspectives in the domain of translation theories.

• Journal of the Korean Mathematical Society
• /
• v.38 no.6
• /
• pp.1157-1166
• /
• 2001

This paper answers some old questions about approximate similarity and raises new ones. We provide positive evidence and a technique for finding negative evidence on the question of whether approximate similarity is the equivalence relation generated by approximate equivalence and similarity.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.4
• /
• pp.276-283
• /
• 2008

We investigate the images and preimages of intuitionistic fuzzy G-equivalence relations and G-congruences under product mappings.

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.1
• /
• pp.217-227
• /
• 2024

Let G be an infinite countable group and A be a finite set. If Σ ⊆ A^G is a strongly irreducible subshift of finite type and 𝓖 is the local conjugacy equivalence relation on Σ. We construct a decreasing sequence 𝓡 of unital C^*-subalgebras of C(Σ) and a sequence of faithful conditional expectations E defined on C(Σ), and obtain a Toeplitz algebra 𝓣 (𝓡, 𝓔) and a C^*-algebra C^*(𝓡, 𝓔) for the pair (𝓡, 𝓔). We show that C^*(𝓡, 𝓔) is *-isomorphic to the reduced groupoid C^*-algebra C^*_r(𝓖).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.2
• /
• pp.106-109
• /
• 1997

In this paper we define the t-fuzzy equivalence relation on a set and we prove some properties in connection with t-fuzzy relations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.401-405
• /
• 2008

We investigate the properties of fuzzy relations and $\odot$-equivalence relation on a stsc quantale lattice L and a commutative cqm-lattice. In particular, fuzzy relations preserve(*, \otimes$)-equivalence relations where $\otimes$ are compositions, $\Rightarrow$ and $\Leftarrow$.