Algorithm for constructing finite idempotent cyclic semirings with commutative addition
Închide
Articolul precedent
Articolul urmator
649 0
SM ISO690:2012
CHUPRAKOV, Dmitri. Algorithm for constructing finite idempotent cyclic semirings with commutative addition. In: Conference of Mathematical Society of the Republic of Moldova, 28 iunie - 2 iulie 2017, Chişinău. Chişinău: Centrul Editorial-Poligrafic al USM, 2017, 4, pp. 59-62. ISBN 978-9975-71-915-5.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Conference of Mathematical Society of the Republic of Moldova
4, 2017
Conferința "Conference of Mathematical Society of the Republic of Moldova"
Chişinău, Moldova, 28 iunie - 2 iulie 2017

Algorithm for constructing finite idempotent cyclic semirings with commutative addition

Pag. 59-62

Chuprakov Dmitri
 
Vyatka State University
 
 
Disponibil în IBN: 3 octombrie 2017


Rezumat

The paper deals with finite idempotent cyclic semirings with commutative addition. The author establishes a connection between idempotent cyclic semirings with commutative addition and ideals of nonnegative integers. An algorithm for constructing these semirings is presented .

Cuvinte-cheie
finite algebra,

Semiring, idempotent, integers, algorithm