Quasigroup words and reversible automata
Jonathan D.H. Smith, Stefanie G. Wang
TL;DR
This paper explores the linearization of reversible automata and the faithful representation of quasigroup words, focusing on their algebraic structures and symmetries.
Contribution
It introduces new methods for linearizing reversible automata and representing quasigroup words that preserve triality symmetry.
Findings
Established a linearization framework for reversible automata
Developed a faithful representation method for quasigroup words
Preserved triality symmetry in quasigroup word representations
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Mathematics and Applications · semigroups and automata theory