Displaying 241 – 260 of 2554

Showing per page

An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid

Laura Giambruno, Antonio Restivo (2008)

RAIRO - Theoretical Informatics and Applications

We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet. To this purpose, we consider automata that recognize such submonoids and we study the product automata recognizing their intersection. By using automata methods we obtain a new proof of a result of Karhumäki on the characterization of the intersection of two submonoids of rank two, in the case of prefix (or suffix) generators. In a more general setting, for an arbitrary number of generators,...

An investigation on hyperS-posets over ordered semihypergroups

Jian Tang, Bijan Davvaz, Xiang-Yun Xie (2017)

Open Mathematics

In this paper, we define and study the hyper S-posets over an ordered semihypergroup in detail. We introduce the hyper version of a pseudoorder in a hyper S-poset, and give some related properties. In particular, we characterize the structure of factor hyper S-posets by pseudoorders. Furthermore, we introduce the concepts of order-congruences and strong order-congruences on a hyper S-poset A, and obtain the relationship between strong order-congruences and pseudoorders on A. We also characterize...

Currently displaying 241 – 260 of 2554