Reversible Automata on Finite Quasigroups

Skobelev Volodymyr; Skobelev Volodymyr

Articolul precedent

Articolul urmator

603

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

Reversible Automata on Finite Quasigroups

Pag. 157-160

Skobelev Volodymyr, Skobelev Volodymyr

Institute of Cybernetics, National Academy of Sciences of Ukraine

Disponibil în IBN: 4 octombrie 2017

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

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Skobelev, V.V.</creatorName>
<affiliation>Institute of Cybernetics, National Academy of Sciences of Ukraine, Ucraina</affiliation>
</creator>
<creator>
<creatorName>Skobelev, V.G.</creatorName>
<affiliation>Institute of Cybernetics, National Academy of Sciences of Ukraine, Ucraina</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Reversible Automata on Finite Quasigroups</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2017</publicationYear>
<relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978-9975-71-915-5</relatedIdentifier>
<subjects>
<subject>automata</subject>
<subject>Quasigroups</subject>
<subject>T-quasigroups</subject>
<subject>hashfunctions</subject>
</subjects>
<dates>
<date dateType='Issued'>2017</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>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. </description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>