• Title/Summary/Keyword: Transitive set

Search Result 65, Processing Time 0.02 seconds

ON RELATIONSHIPS AMONG INTUITIONISTIC FUZZY APPROXIMATION OPERATORS, INTUITIONISTIC FUZZY TOPOLOGY AND INTUITIONISTIC FUZZY AUTOMATA

  • Tiwari, S.P.
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.99-107
    • /
    • 2010
  • This paper is a study about the relationships among topologies and intuitionistic fuzzy topology induced, respectively, by approximation operators and an intuitionistic fuzzy approximation operator associated with an approximation space (X, R), when the relation R on X is precisely reflexive and transitive. In particular, we consider an intuitionistic fuzzy approximation operator on an approximation space X (i.e., a set X with a reflexive and transitive relation on it), which turns out to be an intuitionistic fuzzy closure operator. This intuitionistic fuzzy closure operator gives rise to two saturated fuzzy topologies on X and it turns out that all the level topologies of one of the fuzzy topology coincide and equal to the topology analogously induced on X by a crisp approximation operator. These observations are then applied to intuitionistic fuzzy automata.

THE SPECTRAL DECOMPOSITION FOR FLOWS ON TVS-CONE METRIC SPACES

  • Lee, Kyung Bok
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.91-101
    • /
    • 2022
  • We study some properties of nonwandering set Ω(𝜙) and chain recurrent set CR(𝜙) for an expansive flow which has the POTP on a compact TVS-cone metric spaces. Moreover we shall prove a spectral decomposition theorem for an expansive flow which has the POTP on TVS-cone metric spaces.

Parallel Evaluation of Linearly Recursive Rules using a Shared-Nothing Paralled Architecture (비공유 병렬구조를 이용한 선형적 재귀규칙의 병렬평가)

  • Cho, Woo-Hyun;Kim, Hang-Joon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.12
    • /
    • pp.3069-3077
    • /
    • 1997
  • This paper is concerned with a new paradigm for parallel evaluation of linear recursion rules which contain transitive dependency in a shared-nothing parallel architecture. For parallel evaluation of rules, we consider a shared-nothing parallel architecture that consists of a set of nodes and a message passing network to these nodes. An evaluation of normalized rules is a computation of the proof theoretic meaning of a collection of rules. We shall here define normalized recursion rules which contain transitive dependency, present an equivalent expression for the rule, propose a paradigm for Parallel evaluation of normalized rule based on the equivalent expression using join, partition, and transitive closure operations, and analyze response-time complexity.

  • PDF

ALMOST PERIODIC HOMEOMORPHISMS AND CHAOTIC HOMEOMORPHISMS

  • Lee, Joo Sung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.20 no.4
    • /
    • pp.477-484
    • /
    • 2007
  • Let h : M ${\rightarrow}$ M be an almost periodic homeomorphism of a compact metric space M onto itself. We prove that h is topologically transitive iff every element of M has a dense orbit. It follows as a corollary that an almost periodic homeomorphism of a compact metric space onto itself can not be chaotic. Some additional related observations on a Cantor set are made.

  • PDF

ON GENERALIZED UPPER SETS IN BE-ALGEBRAS

  • Ahn, Sun-Shin;So, Keum-Sook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.2
    • /
    • pp.281-287
    • /
    • 2009
  • In this paper, we develop the idea of a generalized upper set in a BE-algebra. Furthermore, these sets are considered in the context of transitive and self distributive BE-algebras and their ideals, providing characterizations of one type, the generalized upper sets, in terms of the other type, ideals.

Enumerations of Finite Topologies Associated with a Finite Simple Graph

  • Kim, Dongseok;Kwon, Young Soo;Lee, Jaeun
    • Kyungpook Mathematical Journal
    • /
    • v.54 no.4
    • /
    • pp.655-665
    • /
    • 2014
  • The number of topologies (non-homeomorphic topologies) on a fixed finite set having n elements are now known up to n = 18 (n = 16 respectively) but still no complete formula yet. There are one to one correspondences among topologies, preorders and transitive digraphs on a given finite set. In this article, we enumerate topologies and non-homeomorphic topologies whose underlying graph is a given finite simple graph.