Short survey about combinatorics on words and algorithmic methods in a ring (draft)
Mikhail Kharitonov

TL;DR
This paper provides a concise survey of combinatorics on words and algorithmic methods within rings, emphasizing Shirshov's results, tailored for undergraduate students.
Contribution
It offers an accessible overview of key concepts and results in combinatorics on words and algorithms in rings, focusing on Shirshov's work, for educational purposes.
Findings
Highlights Shirshov's key results
Introduces algorithmic methods in rings
Serves as an educational resource for undergraduates
Abstract
A short survey about combinatorics on words and algorithmic methods in a ring. Special attention is given to Shirshov's results. Adopted for undegraduate students.
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
TopicsCoding theory and cryptography · semigroups and automata theory · graph theory and CDMA systems
