Word transformations using left quasigroups
The author examines some elementary algebraic properties of left quasigroups such as isotopes, polynomial completeness, word transformations and congruences. In particular, the paper studies transformations of words over a finite alphabet induced by left quasigroups. Two types of bijective word transformations are introduced, together with their explicit inverses and it is shown that arbitrary compositions of such transformations remain invertible. Furthermore, a Mal'tsev term is constructed, congruences are characterized and it is proved that all congruence classes have equal cardinality. In the second part, polynomial completeness of finite left quasigroups with a right identity element is characterized by simplicity and non-affinity. As a consequence, sufficient conditions for polynomial completeness are derived and explicit examples of small polynomially complete left quasigroups are given.
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
- scientific article; zbMATH DE number 3775602 (Why is no real title available?)
- scientific article; zbMATH DE number 3453503 (Why is no real title available?)
- scientific article; zbMATH DE number 6288955 (Why is no real title available?)
- scientific article; zbMATH DE number 3260806 (Why is no real title available?)
- scientific article; zbMATH DE number 7826074 (Why is no real title available?)
- On congruences of groupoids closely connected with quasigroups.
This page was built for publication: Word transformations using left quasigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879535)
