Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Finite BCI-algebra of KL-Product
جبر BCI المنتهي من النوع KL- جداء
1050
0 23
0
(
0
)
Added by
Damascus University ورقة بحثية
Publication date
2008
fields
Mathematics
and research's language is
العربية
Authors
أحمد هابيل( باحث )
Created by
Shamra Editor
Ask ChatGPT about the research
نقدم في هذا البحث شرطاً لازماً و كافياً لكي يكون X جبر-BCI من النوع -KL جداء، هذا الـشرط عددي صرف و هو أن يكون عدد عناصر السطر المقابل للعنصر الصفري في جدول كايلي للعمليـة قاسماً لعدد عناصر كل سطر في الجدول المذكور.
We present a necessary and sufficient condition for BCI-algebra X to be of KL- product, this condition is pure numerical, that is the number of elements of the row which is opposite to the zero element in the Cayley table of the operation divides the number of elements in each row of the mentioned table.
References used
Dudek, W. A. (1988). On the axioms system for BCI-algebras, Prace Nauk. Wsp, Czestochows, Mathematyka 2
Hoo, C. S. (1990). Closed ideals and p-semisimple BCI-algebras, Math. Japonica. 35, 1103-1112
Iseki, K. (1966) An algebra related with a prepositional czlculus, Pros. Japan. Acad. 42, 26-29
rate research
Read More
A BCI-algebra is a non-empty set X with a binary operation, distinguished
element 0, and the binary operation satisfying some conditions.
In this paper we presents a generalization of some important known
identities in BCI-algebras that could be help in starting new studies in this field.
In this scientific paper, we describe an algorithm to test if the weighted
Dynkin diagram of type -Cn corresponds to one of the nilpotent orbits of sp2n,
then we defined the necessary and sufficient condition on this representative
that makes the
diagram even. We applied this algorithm on one of the weighted
Dynkin diagrams of type –C3 to prove that it is true
Shupamem, a language of Western Cameroon, is a tonal language which also exhibits the morpho-phonological process of full reduplication. This creates two challenges for finite-state model of its morpho-syntax and morphophonology: how to manage the fu
ll reduplication and the autosegmental nature of lexical tone. Dolatian and Heinz (2020) explain how 2-way finite-state transducers can model full reduplication without an exponential increase in states, and finite-state transducers with multiple tapes have been used to model autosegmental tiers, including tone (Wiebe, 1992; Dolatian and Rawski, 2020a). Here we synthesize 2-way finite-state transducers and multitape transducers, resulting in a finite-state formalism that subsumes both, to account for the full reduplicative processes in Shupamem which also affect tone.
In this paper, We study the dual representation. We proved that if
p is completely redusibile, decomposable and unitary then p* is
completely redusibile, decomposable and unitary,
A real-world information extraction (IE) system for semi-structured document images often involves a long pipeline of multiple modules, whose complexity dramatically increases its development and maintenance cost. One can instead consider an end-to-e
nd model that directly maps the input to the target output and simplify the entire process. However, such generation approach is known to lead to unstable performance if not designed carefully. Here we present our recent effort on transitioning from our existing pipeline-based IE system to an end-to-end system focusing on practical challenges that are associated with replacing and deploying the system in real, large-scale production. By carefully formulating document IE as a sequence generation task, we show that a single end-to-end IE system can be built and still achieve competent performance.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
