-
Not to take away from the interesting work that you have been spearheading towards the goal of making uniquely decodable word lists, but I wanted to raise a bit of a counter-point, as food for thought…
bwbug updated
2 years ago
-
I'm proud of Tidy's feature of something I call "Schlinkert pruning", which is based on the Sardinas-Patterson algorithm.
One part of the algorithm requires us to be able to generate a new code _C_…
-
Removing all prefix words and removing all suffix words guarantees that the resulting list will be what's called a [uniquely decodable code](https://www.sciencedirect.com/topics/computer-science/uniq…
sts10 updated
2 years ago
-
Add the following methods to the `WordMorphism` class:
- `is_injective()` - injectivity test
- `is_unboundedly_repetitive()` - whether the morphism is unboundedly repetitive, i.e. has a periodic po…