Pages that link to "Item:Q5945725"
From MaRDI portal
The following pages link to A polynomial bound for certain cases of the D0L sequence equivalence problem (Q5945725):
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)
- D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) (← links)
- A bound for the<i>ω</i>-equivalence problem of polynomial D0L systems (Q4825477) (← links)
- On infinite words generated by polynomial D0L systems (Q5957360) (← links)