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):

Displaying 11 items.

• Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
• Bounds for the D0L language equivalence problem (Q598185) (← links)
• A new bound for the D0L sequence equivalence problem (Q855272) (← links)
• A new bound for the D0L language equivalence problem (Q1702303) (← links)
• The language equivalence problem for HD0L systems having D0L growths (Q1763705) (← links)
• The sequence equivalence problem for primitive D0L systems (Q1936250) (← 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)
• (Q4349578) (← links)
• A bound for the<i>ω</i>-equivalence problem of polynomial D0L systems (Q4825477) (← links)