Pages that link to "Item:Q1405801"
From MaRDI portal
The following pages link to The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet (Q1405801):
Displaying 12 items.
- Bounds for the D0L language equivalence problem (Q598185) (← links)
- A new bound for the D0L sequence equivalence problem (Q855272) (← links)
- On the simplification of infinite morphic words (Q1006088) (← 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)
- (Q3347325) (← links)
- THE D0L ω-EQUIVALENCE PROBLEM (Q3426793) (← 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)
- (Q5130734) (← links)
- THE BASE PROBLEM FOR D0L PARIKH SETS (Q5291307) (← links)
- A polynomial bound for certain cases of the D0L sequence equivalence problem (Q5945725) (← links)
