We study the state complexity of binary operations on regular languages over different alphabets. It is known that if L′m and Ln are languages of state complexities m and n, respectively, and restricted to the same alphabet, the state complexity of any binary boolean operation on L′m and Ln is mn, and that of product (concatenation) is m2 n − 2n−1. In contrast to this, we show that if L′m and L...

generalizing the concepts of -fuzzy (left, right, lateral) ideals, -fuzzy quasi-ideals and   -fuzzy bi (generalized bi-) ideals in ternary semigroups, the notions of -fuzzy (left, right, lateral) ideals, -fuzzy quasi-ideals and -fuzzy bi (generalized bi-) in ternary semigroups are introduced and several related properties are investigated. some new results are obtained.

The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic monomial ideals. The second one is an incremental algorithm, which computes decompositions of ideals by adding one generator at a time. Our analysis shows that th...

In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated lcm-lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial ideal whose lcm-lattice is P , and we give a characterization of all such coordinatizations. We prove that all relations in the lattice L(n) of all finite atom...

In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...

Algebraic structures like fuzzy sub rings of L-Fuzzy sets have been well studied in the case where lattice L is distributive. In this paper axioms concepts can be generalised to not The aim current define concept L-fuzzy meet semi almost ideals and also Intutionistic . Investigate some theorems examples.

An inequality between the number of coverings in the ordered set J(Con L) of join irreducible congruences on a lattice L and the size of L is given. Using this inequality it is shown that this ordered set can be computed in time O(n2 log2 n), where n = |L|. This paper is motivated by the problem of efficiently calculating and representing the congruence lattice Con L of a finite lattice L. Of c...

Let L be the generalized mixed product ideal induced by a monomial ideal I. In this paper we compute powers of the genearlized mixed product ideals and show that Lk  have a linear resolution if and only if Ik have a linear resolution for all k. We also introduce the generalized mixed polymatroidal ideals and prove that powers and monomial localizations of a generalized mixed polymatroidal ideal...