Alphabet Soup
Abstract
Formats available
You can view the full content in the following formats:
Index Terms
- Alphabet Soup
Recommendations
About some overlap-free morphisms on a n-letter alphabet
Third international workshop on descriptional complexity of automata, grammars and related structuresIn 1912, the Norwegian mathematician Axel Thue was the first to describe an overlapfree binary infinite word. This word was generated by a morphism which is called, since the works of Morse, the Thue-Morse morphism.Here we study morphisms, generalizing ...
A characterization of fine words over a finite alphabet
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smallest (resp. greatest) amongst the factors of t of the same length. We say ...
Linear computation of unbordered conjugate on unordered alphabet
We present an algorithm that, given a word w of length n on an unordered alphabet, computes one of its unbordered conjugates. If such a conjugate does not exist, the algorithm computes one of its conjugates that is a power of an unbordered word. The ...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Column
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 189Total Downloads
- Downloads (Last 12 months)154
- Downloads (Last 6 weeks)4
Other Metrics
Citations
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderDigital Edition
View this article in digital edition.
Digital EditionMagazine Site
View this article on the magazine site (external)
Magazine SiteLogin options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in


PDF
Comments
There are no comments at this time.