Abstract
In this paper, we expand the theory of semi-vector spaces and semi-algebras, both over the semi-field of nonnegative real numbers . More precisely, we prove several new results concerning these theories. We introduce to the literature the concept of eigenvalues and eigenvectors of a semi-linear operator, describing how to compute them. The topological properties of semi-vector spaces, such as completeness and separability, are also investigated here. New families of semi-vector spaces derived from the semi-metric, semi-norm and semi-inner product, among others, are exhibited. Furthermore, we show several new results concerning semi-algebras. After this theoretical approach, we apply such a theory in fuzzy automata. More precisely, we describe the semi-algebra of A-fuzzy regular languages and we apply the theory of fuzzy automata for counting patterns in DNA sequences.
MSC:
08A05; 08A72
1. Introduction
The concept of semi-vector space was introduced by Prakash and Sertel in [1]. Roughly speaking, semi-vector spaces are “vector spaces” where the scalars are in a semi-field. Although the concept of semi-vector space was investigated over time, there exist few works available in the literature dealing with such spaces [1,2,3,4,5,6,7]. This fact occurs maybe due to the limitations that such a concept brings, i.e., the non-existence of a (additive) symmetric for some (for all) semi-vectors. A textbook on this topic of research is the book by Kandasamy [8].
Although the seminal paper on semi-vector spaces was the paper by Prakash and Sertel [1], the idea of such a concept is implicit in [7], where Radstrom showed that a semi-vector space over the semi-field of nonnegative real numbers can be extended to a real vector space (see [7], Theorem 1-B.). In [1], Prakash and Sertel investigated the structure of topological semi-vector spaces. The authors were concerned with the study of the existence of fixed points in compact convex sets and also with generating min–max theorems in topological semi-vector spaces. In [6], Prakash and Sertel investigated the properties of the topological semi-vector space consisting of nonempty compact subsets of a real Hausdorff topological vector space. In [5], Pap investigated and formulated the concept of integrals of functions having, as counter-domains, complete semi-vector spaces. W. Gahler and S. Gahler [2] showed that a (ordered) semi-vector space can be extended to a (ordered) vector space and a (ordered) semi-algebra can be extended to a (ordered) algebra. Moreover, they provided an extension of fuzzy numbers. Janyska et al. [3] developed such a theory (of semi-vector spaces) by proving useful results and defining the semi-tensor product of (semi-free) semi-vector spaces. They were also interested in proposing an algebraic model of physical scales. Canarutto [9] explored the concept of semi-vector spaces to express aspects and to exploit nonstandard mathematical notions of the basics of quantum particle physics on a curved Lorentzian background. Moreover, he dealt with the case of electroweak interactions. Additionally, in [10], Canarutto provided a suitable formulation of the fundamental mathematical concepts with respect to quantum field theory. Such a paper presents a natural application of the concept of semi-vector spaces and semi-algebras. Recently, Bedregal et al. [4] investigated (ordered) semi-vector spaces over a weak semi-field K (i.e., both and are monoids) in the context of fuzzy sets and applying the results in multi-criteria group decision-making.
In this paper, we show new results on the theory of semi-vector spaces and semi-algebras. The semi-field of scalars considered here is the semi-field of nonnegative real numbers. We prove several results in the context of semi-vector spaces and semi-linear transformations. We introduce the concept of semi-eigenvalues and semi-eigenvectors of an operator and of a matrix, showing how to compute it in specific cases. We investigate topological properties such as completeness, compactness and separability of semi-vector spaces. Additionally, we present interesting new families of semi-vector spaces derived from semi-metric, semi-norm, semi-inner product and metric-preserving functions, among others. Furthermore, we show several new results concerning semi-algebras. To summarize, we provide new results on semi-vector spaces and semi-algebras, although such theories are very difficult to investigate due to the fact that vectors do not even have (additive) symmetry.
The main motivation of this research is to present an expansion of both theories: semi-vector spaces and semi-algebras. Since a semi-vector space (semi-algebra) is a natural extension of a vector space (algebra), this paper provides new useful tools that can be utilized in several areas of research. In particular, we apply some new results in order to count patterns in DNA sequences (see, Section 4.3). Moreover, due to the fact that the fuzzy theory is correlated with semi-vector spaces and semi-algebras, the new results presented here can be applied directly in the study of novel results on such a theory (fuzzy theory).
In fuzzy sets theory, introduced by Zadeh in [11], the “sets” can have uncertainty frontiers. To deal with this uncertainty one utilizes values in the interval as membership degrees. From then, many extensions of this theory have been proposed; see [12], for instance. On the other hand, in [13], the author proposed the notion of fuzzy languages and fuzzy automata which can be useful to process natural languages instead of formal languages [14] as is the case of automata theory [15]. Many extensions of fuzzy automata have been proposed, ([16,17,18,19]). In this paper, we also introduce a new extension of fuzzy automata, where the membership degree takes values in a semi-algebra.
The paper is organized as follows. In Section 2, we recall some concepts on semi-vector spaces which will be utilized in this work. In Section 3, we present and prove several results concerning semi-vector spaces and semi-linear transformations. We introduce naturally the concepts of the eigenvalue and eigenvector of a semi-linear operator. Additionally, we exhibit and show interesting examples of semi-vector spaces derived from semi-metric, semi-norms and metric-preserving functions, among others. The results concerning semi-algebras are also presented. In Section 4, we show relationships between Fuzzy Set Theory and semi-algebras. More precisely, in Section 4.1, we show some relationships between semi-algebras and fuzzy automata; in Section 4.2, we present the semi-algebras of A-fuzzy regular languages; and, in Section 4.3, we apply the theory of fuzzy automata for counting patterns in DNA sequences. Finally, this paper’s conclusion is presented in Section 5.
2. Preliminaries
The purpose of this section is to recall important facts about semi-vector spaces that are necessary for the development of this work. In order to define such a concept, it is necessary to define the concepts of semi-ring and semi-field.
Definition 1.
A semi-ring is a set S endowed with two binary operations, (addition), (multiplication) such that: (1) is a commutative monoid; (2) is a semigroup; (3) the multiplication • is distributive with respect to +: , and .
We write S instead of writing if there is no possibility of confusion. If the multiplication • is commutative, then S is a commutative semi-ring. If there exists , such that , one has , then S is a semi-ring with identity.
Definition 2
([8] Definition 3.1.1). A semi-field is an ordered triple which is a commutative semi-ring with a unit satisfying the following conditions: (1) , if , then ; (2) if and , then or .
Before proceeding further, it is interesting to observe that, in [2], the authors considered the additive cancellation law in the definition of a semi-vector space. In [3], the authors did not assume the existence of the zero (null) vector.
In this paper, we consider the definition of a semi-vector space in the context of that shown in Section 3.1 of [2].
Definition 3.
A semi-vector space over a semi-field K is an ordered triple , where V is a non-empty set endowed with the operations (vector addition) and (scalar multiplication) such that:
- (1)
- is an abelian monoid equipped with the additive cancellation law: , if , then ;
- (2)
- and , ;
- (3)
- and , ;
- (4)
- and , ;
- (5)
- and , .
Note that, from Item (1) of Definition 3, all semi-vector spaces considered in this paper are regular, that is, the additive cancellation law is satisfied. The zero (or null) vector of V, which is unique, will be denoted by . Let , . If there exists , such that , then v is said to be symmetrizable. A semi-vector space V is said to be simple if the unique symmetrizable element is the zero vector . In other words, V is simple if it has no nonzero symmetrizable elements.
Definition 4
([3] Definition 1.4). Let V be a simple semi-vector space over . A subset is called a semi-basis of V if every , , can be written in a unique way as , where , and is a finite family of indices uniquely determined by v. The finite subset defined by is uniquely determined by v. If a semi-vector space V admits a semi-basis, then it is said to be semi-free.
The concept of semi-dimension can be defined in an analogous way to semi-free semi-vector spaces due to the next results.
Corollary 1
([3] Corollary 1.7). Let V be a semi-free semi-vector space. Then, all semi-bases of V have the same cardinality.
Therefore, the semi-dimension of a semi-free semi-vector space is the cardinality of a semi-basis (consequently, of all semi-bases) of V. We next present some examples of semi-vector spaces.
Example 1.
All real vector spaces are semi-vector spaces, but they are not simple.
Example 2.
The set endowed with the usual sum of coordinates and scalar multiplication is a semi-vector space over .
Example 3.
The set of matrices whose entries are nonnegative real numbers equipped with the sum of matrices and multiplication of a matrix by a scalar (in , of course) is a semi-vector space over .
Example 4.
The set of polynomials with coefficients from and degrees less than or equal to n, equipped with the usual sum of polynomials and the scalar multiplication of a scalar by a polynomial, is a semi-vector space.
Definition 5.
Let be a semi-vector space over . We say that a non-empty subset W of V is a semi-subspace of V if W is closed under both the addition and scalar multiplication of V, that is,
- (1)
- ;
- (2)
- and .
The uniqueness of the zero vector implies that, for each , one has . Moreover, if , it follows that ; applying the regularity, one obtains . Therefore, from Item (2), every semi-subspace contains the zero vector.
Example 5.
Let denote the set of nonnegative rational numbers. The semi-vector space considered as an space is a semi-subspace of considered as an space.
Example 6.
The set of diagonal matrices of order n with entries in is a semi-subspace of , where the latter is the semi-vector space of square matrices with entries in (according to Example 3).
Definition 6
([3] Definition 1.22). Let V and W be two semi-vector spaces over and be a map. We say that T is a semi-linear transformation if: (1) , ; (2) and , .
If U and V are semi-vector spaces, then the set is semilinear} is also a semi-vector space.
3. The New Results
In this section, we present the contributions of this work. More precisely, we show new properties on semi-vector spaces and we introduce the concepts of the eigenvalue and eigenvector of a semi-linear operator. In Section 3.1, we investigate properties of complete semi-vector spaces. In Section 3.2, we provide examples of interesting semi-vector spaces, and, in Section 3.3, we prove several results with respect to semi-algebras.
We start with important remarks.
Remark 1.
- (1)
- Throughout this section, we always consider that the semi-field K is the set of nonnegative real numbers, i.e., .
- (2)
- In the whole section (except Section 3.2), we assume that the semi-vector spaces are simple, i.e., the unique symmetrizable element is the zero vector .
- (3)
- It is well-known that a semi-vector space can be always extended to a vector space according to the equivalence relation on defined by: if and only if (see [7]; see also [2] (Section 3.4)). However, our results were obtained without utilizing such a natural embedding. In other words, if we want to compute, for instance, the eigenvalues of a matrix defined over , we cannot solve the problem in the associated vector spaces and then discard the negative ones. Put differently, all computations performed here are restricted to nonnegative real numbers and also to the fact that a none vector (with the exception of ) is (additive and) symmetrical. However, we will show that, even in this case, several results can be obtained.
Proposition 1.
Let V be a semi-vector space over . Then, the following hold:
- (1)
- Let , , and ; if , then .
- (2)
- If , and , then the equality implies that .
Proof.
(1) If , then there exists its multiplicative inverse , hence , i.e., , a contradiction.
(2) If , assume w.l.o.g. that , i.e., there exists a positive real number c such that . Thus, implies . From the cancellation law, we have , and from Item (1) it follows that , i.e., a contradiction. □
We next introduce in the literature the concepts of the eigenvalue and eigenvector of a semi-linear operator.
Definition 7.
Let V be a semi-vector space and be a semi-linear operator. If there exists a non-zero vector and a nonnegative real number λ, such that , then λ is an eigenvalue of T and v is an eigenvector of T associated with λ.
As is natural, the zero vector joined to the set of the eigenvectors associated with a given eigenvalue has a semi-subspace structure.
Proposition 2.
Let V be a semi-vector space over and be a semi-linear operator. Then, the set is a semi-subspace of V.
Proof.
From the hypotheses, is non-empty. Let , i.e., and . Hence, , i.e., . Further, if and , it follows that , that is, . Therefore, is a semi-subspace of V. □
The next natural step would be to introduce the characteristic polynomial of a matrix, according to the standard linear algebra. However, how does one compute if can be a negative real number? Based on this fact, we must be careful to compute the eigenvectors of a matrix. In fact, the main tools to be utilized in computing the eigenvalues/eigenvectors of a square matrix whose entries are nonnegative real numbers is the additive cancellation law in and also the fact that positive real numbers have multiplicative inverses. However, in many cases, such tools are insufficient to solve the problem. Let us see some cases where it is possible to compute the eigenvalues/eigenvectors of a matrix.
Example 7.
Let us see how to obtain (if there exists) an eigenvalue/eigenvector of a diagonal matrix ,
where are both not zero. We obtain with associated eigenvector and with associated eigenvector .
If and , then with eigenvectors .
If and , then with eigenvectors .
Example 8.
Let be a matrix of the form
where are positive real numbers.
From direct computations, it follows that with eigenvectors .
If V and W are semi-free semi-vector spaces, then it is possible to define the matrix of a semi-linear transformation as in the usual case (vector spaces).
Definition 8.
Let be a semi-liner transformation between semi-free semi-vector spaces with semi-basis and , respectively. Then, the matrix is the matrix of the transformation T.
Theorem 1.
Let V be a semi-free semi-vector space over and let be a semi-linear operator. Then, T admits a semi-basis such that is diagonal if and only if B consists of eigenvectors of T.
Proof.
The proof is analogous to the case of vector spaces. Let be a semi-basis of V whose elements are eigenvectors of T. We then have the following:
which implies that is of the form
On the other hand, let be a semi-basis of V, such that is diagonal:
Thus,
This means that are eigenvectors of T with corresponding eigenvalues , for all . □
Definition 9.
Let be a semi-linear transformation. The set is called kernel of T.
Proposition 3.
Let be a semi-linear transformation. Then, the following hold:
- (1)
- is a semi-subspace of V;
- (2)
- If T is injective then ;
- (3)
- If V has semi-dimension 1, then implies that T is injective.
Proof.
(1) We have . Since W is regular, it follows that , which implies . If and , then and , which implies that is a semi-subspace of V.
(2) Since , it follows that . On the other hand, let , that is, . Since T is injective, one has . Hence, .
(3) Let be a semi-basis of V. Assume that , where are such that and . Hence, . Since and , it follows that . From Item (2) of Proposition 1, one has , i.e., . □
Definition 10.
Let be a semi-linear transformation. The image of T is the set of all vectors such that there exists with , that is, .
Proposition 4.
Let be a semi-linear transformation. Then, the image of T is a semi-subspace of W.
Proof.
The set is non-empty because . It is easy to see that, if and , then and . □
Recall that two semi-vector spaces V and W over a semi-field K are isomorphic; there exists a bijective semi-linear transformation from V to W.
Theorem 2.
Let V be a n-dimensional semi-free semi-vector space over . Then, V is isomorphic to .
Proof.
Let be a semi-basis of V and consider the canonical semi-basis of , where . Define the map as follows: for each , put . It is easy to see that T is bijective semi-linear transformation, i.e., V is isomorphic to , as required. □
3.1. Complete Semi-Vector Spaces
Here, we define and study complete semi-vector spaces, i.e., semi-vector spaces whose norm (inner product) induces a metric under which the space is complete.
Definition 11.
Let V be a semi-vector space over . If there exists a norm on V, we say that V is a normed semi-vector space (or normed semi-space, for short). If the norm defines a metric on V under which V is complete then V is said to be Banach semi-vector space.
Definition 12.
Let V be a semi-vector space over . If there exists an inner product on V, then V is an inner product semi-vector space (or inner product semi-space). If the inner product defines a metric on V under which V is complete, then V is said to be Hilbert semi-vector space.
The well-known norms on are also norms on , as we show in the next propositions.
Proposition 5.
Let be the Euclidean semi-vector space (over ) of semi-dimension n. Define the function as follows: if , put . Then, is a norm on V, called the Euclidean norm on V.
Proof.
It is clear that if and only if and for all and , . To show the triangle inequality, it is sufficient to apply the Cauchy–Schwarz inequality in : if and are semi-vectors in V, then . □
In the next results, we show that the Euclidean norm on generates the Euclidean metric on it.
Proposition 6.
Let , be semi-vectors in . Define the function as follows: for every fixed i, if put ; if , put , where and (in this case, ); then consider . The function d is a metric on V.
Remark 2.
Note that, in Proposition 6, we could have defined simply by the nonnegative real number satisfying . However, we prefer to separate the cases when and in order to improve the readability of this paper.
Proof.
It is easy to see that if and only if and .
We will next prove the triangle inequality. To do this, let , and be semi-vectors in . We look first at a fixed i. If or if two of them are equal, then . Let us then assume that , and are pairwise distinct. We have to analyze the six cases: (1) ; (2) ; (3) ; (4) ; (5) ; (6) . In order to verify the triangle inequality, we will see what occurs in the worst cases. More precisely, we assume that for all we have or, equivalently, . Since both cases are analogous, we only verify the (first) case , for all i. In such cases, there exist positive real numbers , , for all , such that and , which implies . We need to show that , i.e., . The last inequality is equivalent to the inequality . Developing the first member of the previous inequality and deleting the corresponding terms with the first two terms in the second member following the multiplication by , we have , which is the Cauchy–Schwarz inequality in . Therefore, d satisfies the triangle inequality and, hence, is a metric on V. □
Remark 3.
Note that Proposition 6 means that the Euclidean norm on (see Proposition 5) generates the Euclidean metric on . This result is analogous to the fact that every norm defined on vector spaces generates a metric on it. Further, a semi-vector space V is Banach (see Definition 11) if the norm generates a metric under which every Cauchy sequence in V converges to an element of V.
Proposition 7.
Let and define the function as follows: if and are semi-vectors in V, put . Then, is an inner product on V, called the dot product.
Proof.
The proof is immediate. □
Proposition 8.
The dot product on generates the Euclidean norm on V.
Proof.
If , define the norm of x by . Note that the norm is exactly the Euclidean norm given in Proposition 5. □
Remark 4.
We observe that, if an inner product on a semi-vector space V generates a norm and such a norm generates a metric d on V, then V is a Hilbert space (according to Definition 12) if every Cauchy sequence in V converges with respect to d to an element of V.
Proposition 9.
Let and define the function as follows: if , . Then, is a norm on V.
Proof.
The proof is direct. □
Proposition 10.
Let , be semi-vectors in . Define the function in the following way. For every fixed i, if , put ; if , put , where and . Let us consider that . Then, the function is a metric on V derived from the norm shown in Proposition 9.
Proof.
We only prove the triangle inequality. To avoid the stress of notation, we make the same considerations as in the proof of Proposition 6. We then fix i and only investigate the worst case . In this case, there exist positive real numbers , for all , such that and , which implies . Then, for all i, ; hence, . Therefore, is a metric on V. □
Proposition 11.
Let be the Euclidean semi-vector space of semi-dimension n. Define the function as follows: if , take . Then, is a norm on V.
Proposition 12.
Keeping the notation of Proposition 6, define the function such that . Then, is a metric on V. Moreover, is obtained from the norm exhibited in Proposition 11.
Proposition 13.
The norms , and shown in Propositions 5, 9 and 11 are equivalent.
Proof.
It can immediately be seen that . □
In a natural way, we can define the norm of a bounded semi-linear transformation.
Definition 13.
Let V and W be two normed semi-vector spaces and let be a semi-linear transformation. We say that T is bounded if there exists a real number , such that .
If is bounded and , we can consider the quotient . Since such a quotient is upper bounded by c, the supremum exists and it is, at most, c. We then define
Proposition 14.
Let be a bounded semi-linear transformation. Then, the following hold:
- (1)
- T sends bounded sets in bounded sets;
- (2)
- is a norm, called norm of T;
- (3)
- can be written in the form .
Proof.
Items (1) and (2) are immediate. The proof of Item (3) is analogous to the standard proof but we present it here to guarantee that our mathematical tools are sufficient to perform it. Let be a semi-vector with norm and set . Thus, and since T is semi-linear, one has
□
Semi-Spaces , and
In this subsection, we investigate the topological aspects of some semi-vector spaces over , such as completeness and separability. We investigate the sequence spaces , , , which will be defined in the sequence.
We first study the space , the set of all bounded sequences of nonnegative real numbers. Before studying such a space, we must define a metric on it, since the metric in , which is defined as , where and are sequences in , has no meaning to us, because there is no sense in considering if . Based on this fact, we circumvent this problem by utilizing the total order of according to Proposition 6. Let and be sequences in . We then fix i, and define as was carried out in Proposition 6: if , then we put ; if , let and ; then, there exists a positive real number such that and, in place of , we put . Thus, our metric becomes
It is clear that , as shown in Equation (1), defines a metric. However, we must show that the tools that we have are sufficient to prove this fact, once we are working on .
Proposition 15.
The function d shown in Equation (1) is a metric on .
Proof.
It is clear that and . Let and be two sequences in . Then, for every fixed , if then , i.e., . If then is computed by , where and . Hence, is computed by , where and , which implies . Taking the supremum over all i’s we have .
To show the triangle inequality, let , and be sequences in . For every fixed i, we will prove that . If , the result is trivial. If two of them are equal, the result is also trivial. Assume that , and are pairwise distinct. As in the proof of Proposition 6, we must investigate the six cases:
(1) ; (2) ; (3) ; (4) ; (5) ; (6) . We only show (1) and (2).
To show (1), note that there exist positive real numbers and , such that and , which implies . Hence, .
Let us show (2). There exist positive real numbers and , such that and , so . Therefore, .
Taking the supremum over all i’s, we have
i.e., . Therefore, d is a metric on . □
Definition 14.
The metric space is the set of all bounded sequences of nonnegative real numbers equipped with the metric given previously.
We prove that equipped with the previous metric is complete.
Theorem 3.
The space with the metric shown above is complete.
Proof.
The proof follows the same line as the standard proof of completeness of ; however, it is necessary to adapt it to the metric (written above) in terms of nonnegative real numbers. Let be a Cauchy sequence in , where . We must show that converges to an element of . As is Cauchy, given , there exists a positive integer, k such that, for all ,
where is a nonnegative real number, such that, if then , and if then is given by . This implies that, for each fixed j, one has
where . Thus, for each fixed j, it follows that is a Cauchy sequence in . Since is a complete metric space, the sequence converges to an element in . Hence, for each j, we form the sequence x whose coordinates are the limits , i.e., . We must show that and .
To show that x is a bounded sequence, let us consider the number defined as follows: if then , and if , define as being the positive real number satisfying . From the inequality (2), one has
Because and since , it follows that is a bounded sequence for every j. Hence, . From (3), we have
which implies that . Therefore, is complete. □
Although is a complete metric space, it is not separable.
Theorem 4.
The space with the metric is not separable.
Proof.
The proof is the same as shown in ([20] 1.3-9), so it is omitted. □
Let us define the space analogous to the space .
Definition 15.
Let be a fixed real number. The set consists of all sequences of nonnegative real numbers, such that , whose metric is defined by , where and is defined as follows: if , and if (respect. ) then is such that .
Theorem 5.
The space with the metric exhibited above is complete.
Proof.
Recall that the given two sequences and in the Minkowski inequality for sums reads as
Applying the Minkowski inequality as per ([20] 1.5-4) with some adaptations, it follows that is, in fact, a metric. In order to prove the completeness of , we proceed similarly as in the proof of Theorem 3 with some adaptations. The main adaptation is performed according to the proof of completeness of in ([20] 1.5-4) replacing the last equality (after Equation (5)) by two equalities in order to avoid negative real numbers.
- (1)
- If the i-th coordinate of the sequence is positive, then define and write . From the Minkowski inequality, it follows that the sequence is in .
- (2)
- If is negative, then define and write . Since , from the comparison criterion for positive series it follows that the sequence is also in .
□
Theorem 6.
The space is separable.
Proof.
The proof follows the same line of ([20] 1.3-10). □
Definition 16.
Let be a closed interval in , where and . Then, is the set of all continuous nonnegative real valued functions on , whose metric is defined by , where is given by .
Theorem 7.
The metric space , where d is given in Definition 16, is complete.
Proof.
The proof follows the same lines as the standard one with some modifications. Let be a Cauchy sequence in . Given, there exists a positive integer N such that, for all , it follows that
where . Thus, for any fixed , we have , for all . This means that is a Cauchy sequence in , which converges to when since is complete. We then define a function such that, for each , we put . Taking in (4), we obtain for all , where , which implies for all . This fact means that converges to uniformly on I, i.e., because the functions ’s are continuous on I. Therefore, is complete, as desired. □
3.2. Interesting Semi-Vector Spaces
In this section, we exhibit semi-vector spaces over derived from semi-metrics, semi-metric-preserving functions, semi-norms, semi-inner products and sub-linear functionals. Recall that a semi-metric is a metric without the condition that if and only if .
Theorem 8.
Let X be a semi-metric space and is a semi-metric on . Then, is a semi-vector space over , where + and · are the pointwise addition and the scalar multiplication (in ), respectively.
Proof.
We first show that is closed under addition. Let and set . It is clear that d is a nonnegative real-valued function. Moreover, for all , . Let ; . For all , .
Let us show that is closed under scalar multiplication. Let and define , where . It is clear that d is real-valued nonnegative and for all , . Moreover, if , . For all , . This means that is closed under scalar multiplication.
It is easy to see that satisfies the other conditions of Definition 3. □
Let be a metric space. In [21], Corazza investigated interesting functions , such that the composite of f with d, i.e., , also generates a metric on X. Let us put this concept formally.
Definition 17.
Let be a function. We say that f is metric-preserving if, for all metric spaces , the composite is a metric.
For our purpose, we will consider semi-metric preserving functions as follows.
Definition 18.
Let be a function. We say that f is semi-metric-preserving if, for all semi-metric spaces , the composite is a semi-metric.
We next show that the set of semi-metric preserving functions has a semi-vector space structure.
Theorem 9.
Let . Then, is a semi-vector space over , where + and · are the pointwise addition and the scalar multiplication (in ), respectively.
Proof.
We begin by showing that is closed under pointwise addition and scalar multiplication.
Let . Given a semi-metric space , we must prove that is also semi-metric preserving. We know that for all . Let ; then . It is clear that . Let . One has .
Here, we show that, for each and , it follows that . We show only the triangular inequality since the other conditions are immediate. Let us calculate the following: .
The null vector is the null function . The other conditions are easy to verify. □
Theorem 10.
Let V be a semi-normed real vector space and is a semi-norm on . Then, is a semi-vector space over , where + and · are pointwise addition and scalar multiplication (in ), respectively.
Proof.
From the hypotheses, is non-empty. Let and set . For all , . If and , then . For every , it follows that . Hence, is closed under addition.
We next show that is closed under scalar multiplication. Let and define , where . For all , . If and , . Let . Then, . Therefore, is closed under addition and scalar multiplication over .
The zero vector is the null function . The other conditions of Definition 3 are straightforward. □
Remark 5.
Note that is a norm on is also closed under both pointwise function addition and scalar multiplication.
Lemma 1.
Let be a linear transformation.
- (1)
- If is a semi-norm on W, then is a semi-norm on V.
- (2)
- If T is injective linear and is a norm on W, then is a norm on V.
Proof.
We only show Item (1). It is clear that for all . For all and , . Moreover, , . Therefore, is a semi-norm on V. □
Theorem 11.
Let V and W be two semi-normed vector spaces and be a linear transformation. Then
is a semi-subspace of .
Proof.
From the hypotheses, it follows that is non-empty. From Item (1) of Lemma 1, it follows that is a semi-norm on V. Let , i.e., and , where and are semi-norms on W. Then, . For every nonnegative real number and , . □
Theorem 12.
Let be the class whose members are , where ’s are given in Theorem 10. Let be the class whose members are the sets
where is a linear transformation and is a semi-norm on V. Then, is a category.
Proof.
The sets are pairwise disjointed. For each , there exists given by . It is clear that, if , then and .
It is easy to see that, for every linear transformation, the map is semi-linear, i.e., and , for every and .
Let and , , , i.e.,
The linear transformations are of the forms
The associativity follows from the associativity of composition of the maps. Moreover, the map because and is a linear transformation. Therefore, is a category, as required. □
Theorem 13.
Let V be a real vector space endowed with a semi-inner product and let is a semi-inner product on . Then, is a semi-vector space over , where + and · are pointwise addition and scalar multiplication (in ), respectively.
Proof.
The proof is analogous to that of Theorems 8 and 10. □
Proposition 16.
Let be two vector spaces and be two linear transformations. Let us consider the map given by . If is a semi-inner product on W, then is a semi-inner product on V.
Proof.
The proof is immediate, so it is omitted. □
Let V be a real vector space. Recall that a sub-linear functional on V is a functional which is sub-additive: , ; and positive-homogeneous: and , .
Theorem 14.
Let V be a real vector space. Let us consider . Then, is a semi-vector space on , where + and · are pointwise addition and scalar multiplication (in ), respectively.
Proof.
The proof follows the same line of that of Theorems 8 and 10 and 13. □
3.3. Semi-Algebras
We start this section by recalling the definition of semi-algebra and semi-sub-algebra. For more details, the reader can consult [2]. In [22], Olivier and Serrato investigated relation semi-algebras, i.e., a semi-algebra being both a Boolean algebra and an involutive semi-monoid, satisfying some conditions (see page 2 in Ref. [22] for more details). Roy [23] studied the semi-algebras of continuous and monotone functions on compact ordered spaces.
Definition 19.
A semi-algebra A over a semi-field K (or a K-semi-algebra) is a semi-vector space A over K endowed with a binary operation called the multiplication of semi-vectors such that and :
- (1a)
- (left-distributivity);
- (1b)
- (right-distributivity);
- (2)
- .
A semi-algebra A is associative if for all ; A is said to be commutative (or abelian) if the multiplication is commutative, that is, , ; A is called a semi-algebra with identity if there exists an element such that , ; the element is called the identity of A. The identity element of a semi-algebra A is unique (if exists). If A is a semi-free semi-vector space, then the dimension of A is its dimension regarded as a semi-vector space. A semi-algebra is simple if it is simple as a semi-vector space.
Example 9.
The set is a commutative semi-algebra with identity .
Example 10.
The set of square matrices of order n whose entries are in , are equipped with the sum of matrices, the multiplication of a matrix by a scalar (in , of course) and by the multiplication of matrices, constituting an associative and non-commutative semi-algebra with identity (the identity matrix of order n), over .
Example 11.
Let V be a semi-vector space over a semi-field K. Then, the set is a semi-vector space. If we define a vector multiplication as the composite of semi-linear operators (which is also semi-linear), then we have a semi-algebra over K.
Definition 20.
Let A be a semi-algebra over K. We say that a non-empty set is a semi-subalgebra if S is closed under the operations of A, that is,
- (1)
- , ;
- (2)
- , ;
- (3)
- and , .
Definition 21.
Let A and B two semi-algebras over K. We say that a map is an K-semi-algebra homomorphism if, and , the following conditions hold:
- (1)
- ;
- (2)
- ;
- (3)
- .
Definition 21 means that T is both a semi-ring homomorphism and also semi-linear (as a semi-vector space).
Definition 22.
Let A and B be two K-semi-algebras. A K-semi-algebra isomorphism is a bijective K-semi-algebra homomorphism. If there exists such an isomorphism, we say that A is isomorphic to B, written .
The following results seems to be new, because semi-algebras over have not been investigated much in the literature.
Proposition 17.
Assume that A and B are two K-semi-algebras, where and A has identity . Let be a K-semi-algebra homomorphism. Then, the following properties hold:
- (1)
- ;
- (2)
- If is invertible, then its inverse is unique and ;
- (3)
- If T is surjective, then , i.e., B also has identity; furthermore, ;
- (4)
- If are invertible, then ;
- (5)
- The composite of K-semi-algebra homomorphisms is also a K-semi-algebra homomorphism;
- (6)
- If T is a K-semi-algebra isomorphism, then is also;
- (7)
- The relation , if and only if A is isomorphic to B, is an equivalence relation.
Proof.
Note that Item (1) holds because the additive cancelation law holds in the definition of semi-vector spaces (see Definition 3). We only show Item (3) since the remaining items are direct. Let ; then, there exists such that . It then follows that and , which means that is the identity of B, i.e., .
We have and , which implies . □
Proposition 18.
If A is a K-semi-algebra with identity , then A can be embedded in , the semi-algebra of semi-linear operators on A.
Proof.
For every fixed , define as . It is easy to see that is a semi-linear operator on A. Define by . We must show that h is a injective K-semi-algebra homomorphism where the product in is the composite of maps from A into A. Fixing , we have the following: , hence . For and , it follows that , i.e., . For fixed , , i.e., . Assume that , that is, ; hence, for every , , i.e., . Taking, in particular, , it follows that , which implies that h is injective. Therefore, A is isomorphic to , where . □
Definition 23.
Let A be a semi-vector space over a semi-field K. Then, A is said to be a Lie semi-algebra if A is equipped with a product such that the following conditions hold:
- (1)
- is semi-bilinear, i.e., fixing the first (second) variable, is semi-linear with respect to the second (first) one;
- (2)
- is anti-symmetric, i.e., ;
- (3)
- satisfies the Jacobi identity: , .
From Definition 23, we can see that a Lie semi-algebra can be non-associative, i.e., the product is not always associative.
Let us now consider the semi-algebra of matrices of order n with entries in (see Example 10). We know that is simple, i.e., with the exception of the zero matrix (zero vector), no matrix is (additive) symmetric. Therefore, the product of such matrices can be nonzero. However, in the case of a Lie semi-algebra A, if A is simple, then the unique product , that can be defined over A, is the zero product, as is shown in the next result.
Proposition 19.
If A is a simple Lie semi-algebra over a semi-field K, then the semi-algebra is abelian, i.e., for all .
Proof.
Assume that and . From Items (1) and (2) of Definition 23, it follows that , i.e., . This means that has symmetric , a contradiction. □
Definition 24.
Let A be a Lie semi-algebra over a semi-field K. A Lie semi-subalgebra is a semi-subspace of A which is closed under , i.e., for all , .
Corollary 2.
All semi-subspaces of A are semi-subalgebras of A.
Proof.
Apply Proposition 19. □
4. Fuzzy Set Theory and Semi-Algebras
The theory of semi-vector spaces and semi-algebras is a natural generalization of the corresponding theories of vector spaces and algebras. Since the scalars are in semi-fields (weak semi-fields), some standard properties do not hold in this new context. However, as we have shown in Section 3, even in the case of the nonexistence of symmetrizable elements, several results are still true. An application of the theory of semi-vector spaces is in the investigation of Fuzzy Set Theory, which was introduced by Lotfali Askar-Zadeh [11]. In fact, such a theory fits in the investigation/extension of results concerning fuzzy sets and their corresponding theory. Let us see an example.
Let L be a linearly ordered complete lattice with distinct smallest and largest elements 0 and 1. Recall that a L-fuzzy number is a function on the field of real numbers satisfying the following items (see [2] Sect. 1.1): (1) for each the set is a closed interval , where ; (2) is bounded.
The addition of two fuzzy numbers x and y is the fuzzy number defined for each by
Analogously, the product of x and y is the fuzzy number , for each given by
The scalar product of and is the fuzzy number such that , where
We denote the set to be the set of all fuzzy numbers; can be equipped with a partial order in the following manner: if and only if and for all . Additionally, in [24], the authors investigated linear orders on fuzzy numbers which refine this partial order. In this scenario, Gahler et al. showed that the concepts of semi-algebras can be utilized to extend the concept of fuzzy numbers, according to the following proposition:
Proposition 20
([2] Proposition 19). The set is an ordered commutative semi-algebra.
Thus, a direct utilization of the investigation of the structures of semi-vector spaces and semi-algebras is the possibility to generate new interesting results on the Fuzzy Set Theory.
Let . Shang et al., in [25], introduced a new type of fuzzy sets where the membership are elements of . The product order on is given as follows: for all and vectors in , define for each , where is the i-th projection [26]. Another work relating semi-vector spaces and Fuzzy Set Theory is the study by Bedregal et al. [4]. In order to study the aggregation functions (geometric mean, weighted average and ordered weighted averaging, among others) with respect to an admissible order (a total order ⪯ on such that, for all , ), the authors worked with semi-vector spaces over the weak semi-field where, for all , and · is the usual multiplication. With these concepts in mind, the authors showed two important results:
Theorem 15
([4] Theorem 1). is a semi-vector space over U, where and . Moreover, is an ordered semi-vector space over U, where is the product order.
Proposition 21
([4] Propostion 2). For any bijection , the pair is an ordered semi-vector space over U, where , defined in ([4] Example 1), is an admissible order.
Clearly, except for the additive cancellation law, jointly with the operation , for all and vectors in , is a commutative semi-algebra over U. As a consequence of the investigation conducted, the authors propose an algorithm to perform a multi-criteria and multi-expert decision-making method.
Summarizing the ideas: The theory of semi-vector spaces in [4] can be related to our theory of semi-algebras, increasing the connection between fuzzy set theory and semi-algebras. Therefore, it is important to understand deeply which are the algebraic and geometry structures of semi-vector spaces, providing, in this way, support for the development of our own theory as well as other interesting theories such as, for example, the Fuzzy Set Theory. In the next subsection, we provide a connection between K-semi-algebra and fuzzy formal language [14].
4.1. K-Fuzzy Automata
Let A be a K-semi-algebra and U a set. Then, a K-fuzzy set F over U is a function . The support of F is the set .
Let be the free monoid generated by a set of input symbols X with concatenation as a binary operation. We will denote this by the identity element of , i.e., the empty string. An A-fuzzy language over a set of input symbols X has any function .
Definition 25.
Let A be a K-semi-algebra with identity . Then, the system is a K-Fuzzy Finite Automaton, K-FFA for short, if Q and X are nonempty finite disjoint sets, is such that for each , and . The elements of Q are the states and elements of X of input symbols. The mapping ϱ, ι and τ are the K-fuzzy transition function, K-fuzzy initial state set and K-fuzzy final state set, respectively.
Example 12.
Let A be a commutative K-semi-algebra with identity and three different elements . Then, where , , and for each
is a K-FFA. Analogously, as occurs in automata theory, finite automata are graphically represented. In particular, the graphical representation of this K-FFA is presented in Figure 1.
Figure 1.
Graphical representation of a K-FFA.
Notice that, if A is the K-semi-algebra of fuzzy numbers, then , and and c are arbitrary fuzzy numbers (different from ).
Definition 26.
Let A be a K-semi-algebra with identity and be a K-FFA. Then, the extension of ϱ is the mapping recursively defined for each , by
whenever and , where the sum is with respect to the addition of the K-semi-algebra.
Definition 27.
Let A be a K-semi-algebra with identity and be a K-FFA. M is deterministic if
- (1)
- there is such that, for each , ;
- (2)
- for each , such that , ;
- (3)
- for each and , and , then .
Proposition 22.
Let A be an associative K-semi-algebra with identity and be a K-FFA such that whenever and . If is a right annihilator element, i.e., for each , then for each and , we have
Proof.
The proof is confirmed by induction on . If , then . Hence, for each , since whenever and , it follows that
Suppose now that for any such that . Thus, if is such that , then there are and such that and . Therefore,
□
Definition 28.
Let A be a K-semi-algebra with identity and be a K-FFA. Then, the A-fuzzy language accepted by M is where, for each ,
A-fuzzy languages accepted by a K-FFA on a nonempty set of input symbols X will be called A-fuzzy regular languages on X and the set of all them will be denoted by .
Example 13.
The A-fuzzy language accepted by the K-FFA of Example 12, for each , is
where , , , , , .
4.2. The Semi-Algebras of A-Fuzzy Regular Languages
In the following, for each , and for each positive integer n.
Definition 29.
Let and be A-fuzzy languages over a set of input symbols X, respectively. We then define the following:
- Scalar product of an A-fuzzy language: given , the scalar product of α with L is the A-fuzzy language , where for each ;
- Addition of A-fuzzy languages: the addition of and is the A-fuzzy language , where for each ;
- Multiplication of A-fuzzy languages: the multiplication of and is the A-fuzzy language , where for each .
Lemma 2.
Let X be a non-empty set of input symbols and A be a K-semi-algebra with identity. Then, for each family , we have that
Theorem 16.
Let X be a non-empty set of input symbols and A be a K-semi-algebra with identity. The K-fuzzy regular languages on X are closed under the scalar product. Moreover, if is the left annihilator element of the •, i.e., for each , then the K-fuzzy regular languages on X are closed under addition and multiplication operations in Definition 29.
Proof.
Let L be K-fuzzy regular language on X and . Then, there exists a K-FFA such that . We now define where, for each and , and . Clearly, is a K-FFA.
We first prove by induction on that
If , from Definition 3(5), one has
Suppose that when (n before |w| was deleted) . Then,
Therefore, for each , we have
Therefore, , i.e., the K-fuzzy regular languages on X, are closed under the scalar product operator.
Next, if , then there exist K-FFAs and such that , and . Then, , where , and for each and ,
is clearly a K-FFA. We will prove that . Before this, note that
Since is the left annihilator element of the • and neutral element of +, it follows that
Therefore, , i.e., the K-fuzzy regular languages on X, are closed under the addition operator.
Finally, if , then there are K-FFAs and such that , and . Then, where , and for each and , and
is clearly a K-FFA. We will now prove that .
Since • is associative and commutative, then
Since is an annihilator element of the • and neutral element of +, we have
Therefore, , i.e., the K-fuzzy regular languages on X, are closed under the product operator. □
Theorem 17.
Let K be a semi-field, A be a K-semi-algebra with identity and X a non-empty set of input symbols such that is a left annihilator element of the •. Then, is a K-semi-algebra with identity.
Proof.
This is straightforward from Definition 29 and from the fact that A is a K-semi-algebra. For example, to prove that satisfies the left-distributivity, take . Then, for each ,
□
4.3. Counting Pattern in DNA Sequences
DNA sequences can contain many repetitions of some DNA sequences, called DNA patterns. In other words, a pattern is a contiguous sub-sequence of a DNA sequence. In most situations, the quantity of occurrences of a DNA pattern have important roles in determining if a DNA pattern is interesting or not [27] or to detect some mutational anomalies such as tandem duplication [28].
Let a,c,g,t} be the set of DNA characters or bases, and consider the patterns and and a semi-algebra with identity over a semi-field K and annihilator 0 for •.
Let us consider the K-FFA such that , where is defined in Figure 2 with ,
Then, where m and n are, respectively, the number of occurrences of and .
Figure 2.
K-FFA for counting two DNA patterns.
If A is the set of nonnegative integers in unary (in unary, each nonnegative integer n is represented by a string of n symbols 1, denoted by and, therefore, is the empty string) endowed with an extra element, denoted by , and the operations , , , ; then, for each , is the sum (in unary) of the number of occurrences of and in w. For example, gacattgcatggatacatgtgatacb.
It is worth noting that such a counting cannot be carried out either with nondeterministic finite automata or with fuzzy automata. In fact, nondeterministic finite automata just decide if a string is in the regular language or not and the Mealy or Moore machines are essentially deterministic. The case of fuzzy automata is similar, only deciding the membership degree of a string to a fuzzy language, i.e., a real value in . Of course, we can consider L-fuzzy automata, where L is a complete lattice, as in [29,30]. In particular, this complete lattice can be the set of nonnegative integers in unary A extended with infinitum, denoted here by .
A tentative of L-fuzzy automata for this purposes is shown in Figure 3. In this case, using the notation of [29], gacattgcatggatacatgtgatacgcgc where , , , , , and .
Figure 3.
Tentative L-fuzzy automata for counting two DNA patterns.
Therefore, gacattgcatggatacatgtgatac, that is, these L-fuzzy automata do not perform a counting of and . The unique way to achieve this counting is to enrich the lattice with operations like addition or concatenation if we consider . But, in this case, these operations must satisfy some properties, resulting in fuzzy automata valued in the algebra as the K-FFA proposal in this manuscript.
5. Conclusions
In this paper, we have expanded the theory of semi-vector spaces as well as the theory of semi-algebras, both over the semi-field of nonnegative real numbers. Among these results, we introduced the concept of eigenvalues and eigenvectors of a semi-linear operator. The properties of completeness and separability were also investigated. Since semi-vector spaces and semi-algebras are correlated with fuzzy theory, we described the semi-algebra of A-fuzzy regular languages, after applying the theory of fuzzy automata for counting patterns in DNA sequences. In addition, we provided evidence that the counting of patterns, in general, cannot be achieved either with nondeterministic finite automata or L-fuzzy automata in the sense of [29]. Fuzzy automata have been applied in several areas of research, such as neural networks, learning machines, pattern recognition, control engineering, decision-making, robot control, clinical monitoring, image processing, etc. [31,32]. In particular, applications of fuzzy automata in syntactic pattern recognition can deal with pattern variability by defining inaccurate models [33]. In terms of future work, we intend to apply the K-Fuzzy Automata in Hand Gesture Recognition based on the approaches of [34,35].
Author Contributions
The authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by CNPq (Brazilian National Council for Scientific and Technological Development) under Projects 311429/2020-3 and 302984/2022-4; the UMAG (Universidad de Magallanes) under Project 021016; and the ANID Chile (National Research and Development Agency) provided funding to UMAG, through the FONDEF IDEA I+D project ID23I10288.
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Prakash, P.; Sertel, M.R. Topological semivector spaces, convexity and fixed point theory. Semigroup Forum 1974, 9, 117–138. [Google Scholar] [CrossRef] [Scilit]
- Gahler, W.; Gahler, S. Contributions to fuzzy analysis. Fuzzy Sets Syst. 1999, 105, 201–204. [Google Scholar] [CrossRef] [Scilit]
- Janyska, J.; Modugno, M.; Vitolo, R. Semi-vector spaces and units of measurement. Acta Appl. Math. 2010, 110, 1249–1276. [Google Scholar]
- Milfont, T.; Mezzomo, I.; Bedregal, B.; Mansilla, E.; Bustince, H. Aggregation functions on n-dimensional ordered vectors equipped with an admissible order and an application in multi-criteria group decision-making. Int. J. Approx. Reason. 2021, 137, 34–50. [Google Scholar] [CrossRef] [Scilit]
- Pap, E. Integration of functions with values in complete semi-vector space. In Measure Theory, Oberwolfach 1979; Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 1980; Volume 794, pp. 340–347. [Google Scholar]
- Prakash, P.; Sertel, M.R. Hyperspaces of topological vector spaces: Their embedding in topological vector spaces. Proc. Am. Math. Soc. 1976, 61, 163–168. [Google Scholar] [CrossRef] [Scilit]
- Radstrom, H. An embedding theorem for spaces of convex sets. Proc. Am. Math. Soc. 1952, 3, 165–169. [Google Scholar] [CrossRef] [Scilit]
- Kandasamy, W.B.V. Smarandache Semirings, Semifields, and Semivector Spaces; American Research Press: Rehoboth, NM, USA, 2002. [Google Scholar]
- Canarutto, D. Positive spaces, generalized semi-densities, and quantum interaction. J. Math. Phys. 2012, 53, 032302. [Google Scholar] [CrossRef] [Scilit]
- Canarutto, D. Special generalized densities and propagators: A geometric account. Int. J. Geom. Methods Mod. Phys. 2016, 13, 1530004. [Google Scholar] [CrossRef] [Scilit]
- Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
- Bustince, H.; Barrenechea, E.; Pagola, M.; Fernandez, J.; Xu, Z.; Bedregal, B.; Montero, J.; Hagras, H.; Herrera, F.; Baets, B.D. A historical account of types of fuzzy sets and their relationships. IEEE Trans. Fuzzy Syst. 2016, 24, 179–194. [Google Scholar] [CrossRef] [Scilit]
- Wee, W.G. On Generalizations of Adaptive Algorithm and Application of the Fuzzy Sets Concept to Pattern Classification. Ph.D. Thesis, Purdue University, West Lafayette, IN, USA, 1967. [Google Scholar]
- Mordeson, J.N.; Malik, D.S. Fuzzy Automata and Languages: Theory and Applications; CRC Press: Boca Raton, FL, USA, 2019. [Google Scholar]
- Hopcroft, J.E.; Motwani, R.; Ullman, J.D. Introduction to Automata Theory, Languages, and Computation, 3rd ed.; Pearson: London, UK, 2006. [Google Scholar]
- Costa, V.S.; Bedregal, B. On typical hesitant fuzzy automata. Soft Comput. 2020, 24, 8725–8736. [Google Scholar] [CrossRef] [Scilit]
- Costa, V.S.; Bedregal, B.; Santiago, R.H.N. On closure properties of L-valued linear languages. Fuzzy Sets Syst. 2021, 420, 54–71. [Google Scholar] [CrossRef] [Scilit]
- Gómez, M.; Lizasoain, I.; Moreno, C. Information retrieval from interval-valued fuzzy automata through Kα operators. Fuzzy Sets Syst. 2017, 324, 20–32. [Google Scholar] [CrossRef] [Scilit]
- Wang, Y.; Li, Y. Minimization of lattice multiset finite automata. J. Intell. Fuzzy Syst. 2018, 35, 627–637. [Google Scholar] [CrossRef] [Scilit]
- Kreyszig, E. Introductory Functional Analysis with Applications; John Wiley and Sons Inc.: Hoboken, NJ, USA, 1978. [Google Scholar]
- Corazza, P. Introduction to metric-preserving functions. Am. Math. Mon. 1999, 106, 309–323. [Google Scholar] [CrossRef]
- Olivier, J.-P.; Serrato, D. Initial objects, universal objects for squares, equivalences and congruences in relation semi-algebras and algebras. Math. Log. Quart. 1995, 41, 455–475. [Google Scholar] [CrossRef] [Scilit]
- Roy, A.K. Ideals in semi-algebras of continuous, monotone functions on a compact ordered space. Math. Ann. 1970, 185, 231–246. [Google Scholar] [CrossRef] [Scilit]
- Zumelzu, N.; Bedregal, B.; Mansilla, E.; Bustince, H.; Diaz, R. Admissible orders on fuzzy numbers. IEEE Trans. Fuzzy Syst. 2022, 30, 4788–4799. [Google Scholar] [CrossRef] [Scilit]
- Shang, Y.; Yuan, X.; Lee, E.S. The n-dimensional fuzzy sets and Zadeh fuzzy sets based on the finite valued fuzzy sets. Comput. Math. Appl. 2010, 60, 442–463. [Google Scholar] [CrossRef] [Scilit]
- Bedregal, B.; Beliakov, G.; Bustince, H.; Calvo, T.; Mesiar, R.; Paternain, D. A class of fuzzy multisets with a fixed number of memberships. Inf. Sci. 2012, 189, 1–17. [Google Scholar] [CrossRef] [Scilit]
- Rashid, M.M.; Karim, M.R.; Jeong, B.-S.; Choi, H.-J. Efficient mining of interesting patterns in large biological sequences. Genom. Inform. 2012, 10, 44–50. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Brejová, B.; DiMarco, C.; Vinař, T.; Hidalgo, S.R.; Holguin, G.; Patten, C. Finding Patterns in Biological Sequences; Project Report for CS798g, Fall; University of Waterloo: Waterloo, ON, Canada, 2000. [Google Scholar]
- Li, Y. Finite automata theory with membership values in lattices. Inf. Sci. 2011, 181, 1003–1017. [Google Scholar] [CrossRef] [Scilit]
- Singh, S.; Tiwari, S.P. L-fuzzy automata theory: Some characterizations via general fuzzy operators. Fuzzy Sets Syst. 2023, 460, 103–142. [Google Scholar] [CrossRef] [Scilit]
- Micić, I.; Nguyen, L.A.; Stanimirović, S. Characterization and computation of approximate bisimulations for fuzzy automata. Fuzzy Sets Syst. 2022, 442, 331–350. [Google Scholar] [CrossRef] [Scilit]
- Singh, R.K.; Rani, A.; Sachan, M.K. Fuzzy Automata: A Quantitative Review. Int. J. Future Revolut. Comput. Sci. Commun. Eng. 2017, 3, 11–17. [Google Scholar]
- Bailador, G.; Triviño, G. Pattern recognition using temporal fuzzy automata. Fuzzy Sets Syst. 2016, 161, 37–55. [Google Scholar] [CrossRef] [Scilit]
- Bedregal, B.C.; Costa, A.C.; Dimuro, G.P. Fuzzy Rule-Based Hand Gesture Recognition. In Proceedings of the IFIP International Conference on Artificial Intelligence in Theory and Practice, Santiago, Chile, 21–24 August 2006; pp. 285–294. [Google Scholar]
- Berezhnoy, V.; Popov, D.; Afanasyev, I.; Mavridis, N. The Hand-gesture-based Control Interface with Wearable Glove System. In Proceedings of the 15th International Conference on Informatics in Control, Automation and Robotics (ICINCO 2018), Porto, Portugal, 29–31 July 2018; Volume 2, pp. 448–455. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).


