Pages that link to "Item:Q1702303"
From MaRDI portal
The following pages link to A new bound for the D0L language equivalence problem (Q1702303):
Displaying 12 items.
- Bounds for the D0L language equivalence problem (Q598185) (← links)
- A new bound for the D0L sequence equivalence problem (Q855272) (← links)
- Bounded D0L languages (Q1098317) (← links)
- A new complete language for DSPACE(log n) (Q1123607) (← links)
- Simple reductions between \(D0L\) language and sequence equivalence problems (Q1208490) (← links)
- On D0L systems with immigration (Q1314370) (← links)
- The language equivalence problem for HD0L systems having D0L growths (Q1763705) (← links)
- The sequence equivalence problem for primitive D0L systems (Q1936250) (← links)
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- (Q4699310) (← links)
- The equivalence problem for languages defined by transductions on D0L languages (Q5462883) (← links)