نتایج جستجو برای: lattice valued map

تعداد نتایج: 323037  

We develop a general framework for various lattice-valued, probabilistic and approach uniform convergence spaces. To this end, we use the concept of $s$-stratified $LM$-filter, where $L$ and $M$ are suitable frames. A stratified $LMN$-uniform convergence tower is then a family of structures indexed by a quantale $N$. For different choices of $L,M$ and $N$ we obtain the lattice-valued, probabili...

Journal: :Rocky Mountain Journal of Mathematics 1976

Journal: :Fuzzy Sets and Systems 2006
Yongming Li

Some uniform categorical theoretical treatment of automata and lattice-valued fuzzy automata using quantale theory is studied in this paper. First, L-relational sheaves on a monoidM andQ-enriched categories are introduced for quantales L andQ, the equivalence of the corresponding categories are proved next. Then lattice-valued (fuzzy) automata are described by Q-enriched categories. In fact, la...

In this paper we provide a common framework for different stratified $LM$-convergence spaces introduced recently. To this end, we slightly alter the definition of a stratified $LMN$-convergence tower space. We briefly discuss the categorical properties and show that the category of these spaces is a Cartesian closed and extensional topological category. We also study the relationship of our cat...

L. X. Lu S. E. Han W. Yao

The aim of this paper is to extend the truth value table oflattice-valued convergence spaces to a more general case andthen to use it to introduce and study the quantale-valued fuzzy Scotttopology in fuzzy domain theory. Let $(L,*,varepsilon)$ be acommutative unital quantale and let $otimes$ be a binary operationon $L$ which is distributive over nonempty subsets. The quadruple$(L,*,otimes,varep...

2012
Shulamit Halamish Orna Kupferman

Traditional automata accept or reject their input, and are therefore Boolean. Lattice automata generalize the traditional setting and map words to values taken from a lattice. In particular, in a fully-ordered lattice, the elements are 0, 1, . . . , n − 1, ordered by the standard ≤ order. Lattice automata, and in particular lattice automata defined with respect to fully-ordered lattices, have i...

2003
Alex Greilich Mario Markus

We consider three systems that are spatially one-dimensional and are discretized in space and time: i) cellular automata proposed by Wolfram; ii) a system that has been used as a prototype for coupled map lattices; and iii) a coupled map lattice that provides a simple description of earthquakes. Chaotic modes of these systems can be made periodic by external forcing at points equidistant in spa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید