Articolul precedent |
Articolul urmator |
586 1 |
Ultima descărcare din IBN: 2021-11-08 14:07 |
SM ISO690:2012 SKOBELEV, Volodymyr, SKOBELEV, Volodymyr. Reversible Automata on Finite Quasigroups. 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. 157-160. 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 | |||||
|
|||||
Pag. 157-160 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
In the given paper families of semi-automata, Mealy and Moore automata defined on finite abstract quasigroups, and on T-quasigroups are introduced and analyzed. Some applications of proposed models for resolving problems of information protection are discussed briefly. |
|||||
Cuvinte-cheie automata, Quasigroups, T-quasigroups, hashfunctions |
|||||
|