Pages that link to "Item:Q1151051"
From MaRDI portal
The following pages link to On a bound for the DOL sequence equivalence problem (Q1151051):
Displaying 6 items.
- Bounds for the D0L language equivalence problem (Q598185) (← links)
- A new bound for the D0L sequence equivalence problem (Q855272) (← links)
- Explicit test sets for iterated morphisms in free monoids and metabelian groups (Q1763708) (← links)
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836) (← links)
- D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) (← links)
- Easy cases of the D0L sequence equivalence problem (Q5951971) (← links)
