Académique Documents
Professionnel Documents
Culture Documents
Outline
1
Preliminaries
Complete orthomodular lattice -valued subset -valued topology and -valued closure operator
4 5
Conclusion References
-valued automata and associated -valued topologies
(L, , , , , 0, 1) is complete lattice, 0 and 1 are respectively the least and greatest elements of L; is the partial ordering in L, A L, A and A are respectively the greatest lower bound and the least upper bound of A, is a uninary operator (called orthocomplement ) on L, such that a, b L, a a = 0, a a = 1, a = a, a b b a , a (a (a b)) b.
-valued subsets
A mapping A : X L is called an -valued subset of X . LX will denote the set of all -valued subsets of X . A, B LX , |= A B, if A(x) B(x), x X . For given -valued sets (Ai )iI , the -valued sets ( and ( iI Ai ) are respectively given by ( (
iI iI iI
Ai )
Ai )(x) =
def iI iI def
Ai (x), x X , Ai (x), x X .
Ai )(x) =
-valued topology
Denition An -valued topology on a nonempty set X is a family of -valued subsets in X , which is closed under arbitrary union and nite intersection and which contains and X . The pair (X , ) is called an -valued topological space and -valued subset of X in are called -valued open sets. The complement of an -valued open set is called -valued closed set.
-valued relation
-valued reexive if R(x, x) = 1, x X , -valued symmetric if R(x, y ) R(y, x), x, y X , and -valued transitive if R(x, z) {R(x, y) R(y, z) : y X } , x, z X .
{R(x, y) A(y) : y X }, A LX , x X
A natural generalization of lower approximation operator to -valued lower approximation operator can also dene. However, our interest is only on -valued upper approximation operator. So, we call it an -valued approximation operator.
Shambhu Sharan Deptt. of Applied Maths ISM, Dhanbad -valued automata and associated -valued topologies
Theorem An -valued relation R on a set X is -valued reexive and -valued transitive if and only if (the associated) -valued approximation operator is a Kuratowski saturated -valued closure operator on X . As a consequence, the -valued approximation operator, say c on X associated with an -valued approximation space (X , R), induces a saturated -valued topology on X, which we shall denote as (X ).
Results
Theorem Let R be another -valued ralation on X such that R (x, y) R(y , x). Then R is also an -valued reexive and -valued transitive relation on X . It will induce another -valued approximation operator, say c , on X . This will induce another -valued topology, say (X ), on X. Theorem The following statements are equivalent: (i) L satises the distributive law: a (b c) = (a b) (a c), a, b, c L (ii) a, b L, b (b a) a.
Shambhu Sharan Deptt. of Applied Maths ISM, Dhanbad -valued automata and associated -valued topologies
Results
The relationship between the topologies (X ) and (X ) are given by the following Theorem. Theorem If L is a distributive lattice then the topologies (X ) and (X ) are dual, i.e., A LX is (X )-open if and only if A is (X )-closed.
-valued automata
Denition M = (Q, X , )
1 2 3
Q is a nonempty set (of states of M) X is a monoid (the input monoid of M) with identity e : Q X Q L, such that q, p Q, x, y X , (q, e, p) = and 1 if q = p 0 if q = p
Denition Let (Q, X , ) be an -valued automaton and A LQ , the -valued source and -valued successor of A are respectively the sets (A)(q) = {A(p) (q, x, p) : p Q, x X }, and s(A)(q) = {A(p) (p, y, q) : p Q, y X }.
def def
This operator c must be a Kuratowski saturated -valued closure operator on Q. It will induce a saturated -valued topology on Q, say (Q).
Shambhu Sharan Deptt. of Applied Maths ISM, Dhanbad -valued automata and associated -valued topologies
Result Similar to above, if we dene another -valued relation R on Q, given by R (p, q) = (1{p} )(q), p, q Q. Thus R (p, q) R(q, p) and so, R is also an -valued reexive and -valued transitive relation on Q, and hence it will induce another -valued approximation operator, say c , on Q and it will induce a -valued topology on Q, say (Q). Remark The -valued topologies (Q) and (Q) on Q are precisely the -valued topologies S and R respectively, introduced by Qiu.
Results
Theorem A LQ is an -valued subautomaton of -valued automaton (Q, X , ) iff |= s(A) A, i.e., A is -valued (Q)-open. Theorem A LQ is a -valued separated subautomaton of -valued automaton M = (Q, X , ) if and only if it is (Q)-clopen i.e., (Q)-open as well as (Q)-closed.
Conclusion
The relationships among -valued approximation operator, -valued topology, and -valued automata may offer some new insights in quantum computation. It may possible to introduce the -valued product topology on the state-set of product of two -valued automata. The decompositions of an -valued automaton can be proposed and it will be interesting to see that up to which extent these concepts depend on the distributivity of associated lattice.
References
M.L.D. Chiara, Quantum logic, in: Handbook of Philosophical Logic, III: Alternative to Classical Logic, Reidal, Dordrecht, 1986, 427-469. D. Qiu, Automata theory based on quantum logic: Some characterizations, Information and Computation, 190 (2004) 179-195. Y.H. She, G.J. Wang, An axiomatic approach of fuzzy rough sets based on residuated lattices, Computer and Mathematics with Applications, 58 (2009) 189-201. A.K. Srivastava, S.P. Tiwari, A topology for automata, in: Proc. AFSS Internat. Conf. on Fuzzy System, Lecture Notes in Articial Intelligence, Springer, Berlin, 2275 (2002) 484-490. A.K. Srivastava, S.P. Tiwari, On relationships among fuzzy approximation operators, fuzzy topology, and fuzzy automata, Fuzzy Sets and Systems 138 (2003) 197-204.
Shambhu Sharan Deptt. of Applied Maths ISM, Dhanbad -valued automata and associated -valued topologies
References
S.P. Tiwari, A.K. Srivastava, On a decomposition of fuzzy automata, Fuzzy Sets and Systems 151 (2005) 503-511. M.S. Ying, Automata theory based on quantum logic (I), International Journal of Theoretical Physics, 39 (2000) 981-991. M.S. Ying, Automata theory based on quantum logic (II), International Journal of Theoretical Physics, 39 (2000) 2545-2557. Y.Y. Yao, Two views of the theory of rough sets in nite universes, International Journal of Approximate Reasoning, 15 (1996) 291-317.
THANK YOU