Mesosome Avoidance
Robert Cummings, Jeffrey Shallit, and Paul Staadecker
TL;DR
This paper studies words over a binary alphabet that avoid mesosomes, providing a structure theorem, counting such words, characterizing infinite mesosome-avoiding words, and identifying minimal forbidden words.
Contribution
It introduces a comprehensive framework for mesosome avoidance, including structure, enumeration, and characterization of infinite avoiding words.
Findings
Derived a structure theorem for mesosome-avoiding words
Counted the total number of mesosome-avoiding words
Characterized all infinite mesosome-avoiding words
Abstract
We consider avoiding mesosomes -- that is, words of the form with a conjugate of that is different from -- over a binary alphabet. We give a structure theorem for mesosome-avoiding words, count how many there are, characterize all the infinite mesosome-avoiding words, and determine the minimal forbidden words.
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
Topicssemigroups and automata theory · Cellular Automata and Applications · Advanced Algebra and Logic