in this note first by considering the notion of general fuzzy automata (for simplicity gfa), we define the notions of direct product, restricted direct product and join of two gfa. also, we introduce some operations on (fuzzy) sets and then prove some related theorems. finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given gfa....

We introduce a “generalized small inverse problem (GSIP)” and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . . . , xn) = x0h(x1, . . . , xn) + C = 0(mod M) for an n-variate polynomial h, non-zero integers C and M . Our algorithm is based on lattice-based Coppersmith technique. We provide a strategy for construction of a lattice basis ...

We study the automorphisms of a graph product of finitely-generated abelian groups W . More precisely, we study a natural subgroup Aut W of AutW , with Aut W = AutW whenever vertex groups are finite and in a number of other cases. We prove a number of structure results, including a semi-direct product decomposition Aut W = (InnW ⋊Out W )⋊Aut W . We also give a number of applications, some of wh...

This article gives a natural decomposition of the suspension of a generalized moment-angle complex or partial product space which arises as the polyhedral product functor described below. The introduction and application of the smash product moment-angle complex provides a precise identification of the stable homotopy type of the values of the polyhedral product functor. One direct consequence ...

In this paper we introduce intuitionistic fuzzy almost generalized semi-pre closed mappings and intuitionistic fuzzy almost generalized semi-pre open mappings. We investigate some of their properties. Also we provide the relation between intuitionistic fuzzy almost generalized semi-pre closed mappings and other intuitionistic fuzzy closed mappings.

In this paper, we will study optimality conditions of semi-infinite programs and generalized semi-infinite programs, for which the gradient objective function when evaluated at any feasible direction for the linearized constraint set is non-negative. We consider three types of penalty functions for semi-infinite program and investigate the relationship among the exactness of these penalty funct...

This study attempted to systematically inspect the impact of direct and indirect corrective feedbacks on the writing ability of EFL learners when using product/process based instructions. To do so, 110 female EFL learners, between the ages of 15 and 18, were randomly assigned into four experimental groups to receive four different kinds of treatments, namely product-based instruction with direc...