Pages that link to "Item:Q2575836"

The following pages link to An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836):

Displayed 4 items.

• A new bound for the D0L sequence equivalence problem (Q855272) ‎ (← links)
• The equality problem for infinite words generated by primitive morphisms (Q2389351) ‎ (← links)
• THE D0L ω-EQUIVALENCE PROBLEM (Q3426793) ‎ (← links)
• D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) ‎ (← links)