Author:
Kitpratyakul Pongsakorn,Pibaljommee Bundit
Abstract
<abstract><p>An inductive composition is an operation generalizing from a superposition $ S^n $ on the set of all $ n $-ary terms of type $ \tau $. A binary operation called <italic>inductive product</italic> is obtainable from such composition. It is a generalization of a tree language product but on the set of all $ n $-ary terms of type $ \tau $. Unlike the original one, this inductive product is not associative on the mentioned set. Nonetheless, it turns to be associative on some restricted set. A semigroup arising in this way is the main focus of this paper. We consider its special subsemigroups and semigroup factorizations.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference25 articles.
1. J. Almeida, J. E. Pin, P. Weil, Semigroups whose idempotents form a subsemigroup, Math. Proc. Camb. Phil. Soc., 111 (1992), 241–253. https://doi.org/10.1017/S0305004100075332
2. S. Burris, H. P. Sankappanavar, A Course in Universal Algebra - The Millennium Edition, 2012. Available from: http://www.math.uwaterloo.ca/snburris/htdocs/ualg.html
3. K. Denecke, Menger algebras and clones of terms, East-West J. Math., 5 (2003), 179–193.
4. K. Denecke, The partial clone of linear terms, Sib. Math. J., 57 (2016), 589–598. https://doi.org/10.1134/S0037446616040030
5. K. Denecke, P. Glubudom, Regular elements and Green's relations in power Menger algebras of terms, Demonstr. Math., 41 (2008), 11–22. https://doi.org/10.1515/dema-2013-0055
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献