FridPrefix

Navigation page for Blueprint/D5/S1/Words/Palindromes/FridPrefix/ at upstream snapshot 8a5a8fda7635926e57a21ac526391ccb66238592.

Contents

• The literal zero-digit rule for every Fibonacci palindrome
• A complete box for signed Fibonacci carries
• Regroup endpoint paths into six-bit chunks
• A paired-digit endpoint automaton
• Palindrome reflection forces the paired endpoint language
• Frid prefix lengths in Fibonacci numeration
• The exact palindromic length of every Frid prefix
• An explicit upper bound for Frid prefixes
• Finite languages and the closed endpoint-complement monitor
• Every canonical increasing digit pair has the endpoint complement property
• Bit masks retain actual nondeterministic paths
• A mismatch path constructs reflected unequal Fibonacci letters
• Canonical digit order and Fibonacci value
• Minimum nonempty palindrome factorisation
• Palindromic factorisations bound integral potentials
• Closure and potential tests for paired finite-state runs
• The literal reachable product-state table is grouped by endpoint state q and first rank state p
• The seventeen literal arrays store all 829 endpoint moves for six-bit chunks
• Compressed co-accessibility and product potentials
• The literal deterministic rank table has width 6, initial state 0, and 99 rows
• Integral ranks accumulated on finite chunk runs
• The exact weighted cycle for the Frid digit family
• A product potential bounds every accepted paired chunk word