Skip to content

Conversation

@cxzhong
Copy link
Contributor

@cxzhong cxzhong commented Nov 19, 2025

fix #40466
The Problem: The optimized algorithm assumes that all factors of length n in the D0L-language can be obtained by:

  1. Taking 2-letter words from the language
  2. Applying a high power of the morphism to each letter
  3. Concatenating the images and extracting n-factors

What's Missing: This misses factors that:

Come directly from the axiom word u (like '000' from u='000')
Come from early iterations s^k(u) where k is small (like '010101' from m(000))
Are not extendable on both sides (non-extendable elements)

📝 Checklist

  • The title is concise and informative.
  • The description explains in detail what this PR is about.
  • I have linked a relevant issue or discussion.
  • I have created tests covering the changes.
  • I have updated the documentation and checked the documentation preview.

⌛ Dependencies

@cxzhong cxzhong changed the title fix the non-extendable D0L-language issue in WordMorphism fix the non-extendable D0L-language missing terms in WordMorphism Nov 19, 2025
@cxzhong cxzhong changed the title fix the non-extendable D0L-language missing terms in WordMorphism fix the non-extendable DOL-language missing terms in WordMorphism Nov 19, 2025
@cxzhong cxzhong requested a review from mantepse November 20, 2025 06:24
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

WordMorphism language methods bug for non-extendable systems/languages

1 participant