Pages that link to "Item:Q855272"
From MaRDI portal
The following pages link to A new bound for the D0L sequence equivalence problem (Q855272):
Displaying 11 items.
- Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
- Bounds for the D0L language equivalence problem (Q598185) (← links)
- Equality sets of binary D0L sequences (Q1637341) (← links)
- A new bound for the D0L language equivalence problem (Q1702303) (← links)
- The sequence equivalence problem for primitive D0L systems (Q1936250) (← links)
- The equality problem for infinite words generated by primitive morphisms (Q2389351) (← links)
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836) (← links)
- Equality sets of morphic word sequences (Q2841980) (← links)
- D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) (← links)
- New Extensions and Applications of Welch-Bound-Equality Sequence Sets (Q3588603) (← links)
- A polynomial bound for certain cases of the D0L sequence equivalence problem (Q5945725) (← links)
