Pages that link to "Item:Q5951971"
From MaRDI portal
The following pages link to Easy cases of the D0L sequence equivalence problem (Q5951971):
Displaying 4 items.
- Uni-transitional Watson-Crick D0L systems (Q1603703) (← links)
- Not all simple looking degree sequence problems are easy (Q1750667) (← links)
- D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) (← links)
- A polynomial bound for certain cases of the D0L sequence equivalence problem (Q5945725) (← links)