Quasigroup Words and Reversible Automata

JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING(2022)

引用 0|浏览7
暂无评分
摘要
This paper examines two related topics: the linearization of the reversible automata of Gvaramiya and Plotkin, and the problem of finding a faithful representation of the words in a central quasigroup that respects the triality symmetry of the language of quasigroups. In particular, it is shown that every central pique is a module over a ring on which the triality group acts.
更多
查看译文
关键词
Quasigroup, semisymmetric, reversible automaton, triality
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要