نتایج جستجو برای: regular left

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

2013
Feng Feng Madad Khan Saima Anis Muhammad Qadeer

We first give some useful characterizations of regular semigroups and right weakly regular semigroups by the properties of their bi-ideals, interior ideals, left ideals and right ideals. Based on these characterizations, we also characterize regular semigroups and right weakly regular semigroups by the properties of their (∈,∈ ∨qk)-fuzzy (generalized) bi-ideals, (∈,∈ ∨qk)-fuzzy interior ideals,...

Let $A$ be a Banach algebra and $X$ be a Banach $A$-bimodule with the left and right module actions $pi_ell: Atimes Xrightarrow X$ and $pi_r: Xtimes Arightarrow X$, respectively. In this paper, we  study  the topological centers of the left module action $pi_{ell_n}: Atimes X^{(n)}rightarrow X^{(n)}$ and the right module action $pi_{r_n}:X^{(n)}times Arightarrow X^{(n)}$,  which inherit from th...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1376

this thesis deals with the construction of some function algebras whose corresponding semigroup compactification are universal with respect to some properies of their enveloping semigroups. the special properties are of beigan a left zero, a left simple, a group, an inflation of the right zero, and an inflation of the rectangular band.

Journal: :IJAC 2007
Franco V. Saliola

Recently it has been noticed that many interesting combinatorial objects belong to a class of semigroups called left regular bands, and that random walks on these semigroups encode several well-known random walks. For example, the set of faces of a hyperplane arrangement is endowed with a left regular band structure. This paper studies the module structure of the semigroup algebra of an arbitra...

Journal: :Theor. Comput. Sci. 2016
Rogério Reis Emanuele Rodaro

We introduce the notion of reset left regular decomposition of an ideal regular language and we prove that the category formed by these decompositions with certain morphisms is equivalent to the category of 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 ...

پایان نامه :0 1374

the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...

2010
Douglas Munn

Proper extensions that are “injective on L-related idempotents” of R-unipotent semigroups, and much more generally of the class of generalised left restriction semigroups possessing the ample and congruence conditions, referred to here as glrac semigroups, are described as certain subalgebras of a λ-semidirect product of a left regular band by an R-unipotent or by a glrac semigroup, respectivel...

Journal: :bulletin of the iranian mathematical society 0
nader mohammad ghosseiri academic member of university of kurdistan

abstract. let r be a 2-torsion free ring with identity. in this paper, first we prove that any jordan left derivation (hence, any left derivation) on the full matrix ringmn(r) (n  2) is identically zero, and any generalized left derivation on this ring is a right centralizer. next, we show that if r is also a prime ring and n  1, then any jordan left derivation on the ring tn(r) of all n×n up...

2013
Rogério Reis Emanuele Rodaro

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 ...

2013
Rogério Reis Emanuele Rodaro

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 ...

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

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