The Dedekind–Birkhoff theorem for finite-height modular lattices has previously been generalized to complete modular lattices, using the theory of regular coverings. In this paper, we investigate regular coverings in lattices of filters and lattices of ideals, and the regularization strategy–embedding the lattice into its lattice of filters or lattice of ideals, thereby possibly converting a co...

In this paper we introduce the concept of ideal elements in poe-AG-groupoid and give some characterizations and properties of their ideal elements. So we consider some results concerning ideals in poe-semigroups and investigate them in poe-AG-groupoids. Also, the class of ideal elements of poe-AG-groupoids are studied, certain intrinsic and basic properties of poe-AG-groupoids including: ideal,...

A right ideal is a language L over an alphabet Σ that satisfies L = LΣ∗. We show that there exists a stream (sequence) (Rn | n > 3) of regular right ideal languages, where Rn has n left quotients and is most complex under the following measures of complexity: the state complexities of the left quotients, the number of atoms (intersections of complemented and uncomplemented left quotients), the ...

We introduce the notion of reset left regular decomposition of an ideal regular language and we prove that there is a one-to-one correspondence between these decompositions and strongly connected synchronizing automata. We show that each ideal regular language has at least a reset left regular decomposition. As a consequence each ideal regular language is the set of synchronizing words of some ...

We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean combinations. These properties include effective algebraic characterizations and lattice identities. In the main part of this paper we consider the following determini...