Endowing a lower-bounded partially ordered set with a total addition or with a total difference operation leads to the basic notion of a NAM, that is, a naturally ordered abelian monoid, or a BCK-algebra, respectively. BL-algebras may be alteratively viewed as certain NAMs or certain BCK-algebras. We characterize the appropriate subclasses by making use of those properties which have been so fa...

In this paper we consider pseudo-BCK/BCI-algebras. In particular, we consider properties of minimal elements (x ≤ a implies x = a) in terms of the binary relation ≤ which is reflexive and antisymmetric along with several more complicated conditions. Some of the properties of minimal elements obtained bear resemblance to properties of B-algebras in case the algebraic operations ∗ and ◦ are ident...

We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem. Concerning classical minimality, the known results such as isomorphism between minimal DFAs, and NL-completeness of the DFA minimization problem carry o...

This paper presents a new hyper chaos system based on Hénon and Logistic maps which provides characteristics of high capacity, security and efficiency. The Proposed hyper chaos system is employed to generate the key for diffusion in an image encryption algorithm. The simulation experiments to the image encryption algorithm which based on the proposed hyper chaos system show that the algorithm s...

Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classify these dual presentations in ”left” and ”right” ones and we consider that, when dealing with several algebras in the same research, it is useful to present them unitarily, either as ”left” algebras or as ”right” algeb...

In this paper, we introduce the concept of neutrosophic BCI/BCKalgebras. Elementary properties of neutrosophic BCI/BCK algebras are presented. AMS (2010): 03B60, 03G25, 06F35.

The notion of intersectional soft sets is introduced, and several examples are given. The application of intersectional soft sets to BCK/BCI-algebras is discussed.

In this paper, we will provide an algorithm which allows us to find a BCK-algebra starting from a given binary block code.