Pages that link to "Item:Q1575723"
From MaRDI portal
The following pages link to A short solution for the HDT0L sequence equivalence problem (Q1575723):
Displaying 18 items.
- Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
- Bounds for the D0L language equivalence problem (Q598185) (← links)
- A new bound for the D0L sequence equivalence problem (Q855272) (← links)
- Equality sets of binary D0L sequences (Q1637341) (← links)
- The language equivalence problem for HD0L systems having D0L growths (Q1763705) (← links)
- The equivalence problem for DF0L languages and power series. (Q1872710) (← links)
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836) (← links)
- A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
- Equality sets of morphic word sequences (Q2841980) (← links)
- On the Images of ℕ-Rational Sequences Counting Multiplicities (Q3043616) (← links)
- THE D0L ω-EQUIVALENCE PROBLEM (Q3426793) (← links)
- D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) (← links)
- On infinite HD0L words having sparse letters (Q4464260) (← links)
- Copyful Streaming String Transducers (Q4989167) (← links)
- (Q5090989) (← links)
- Streaming ranked-tree-to-string transducers (Q5918275) (← links)
- Easy cases of the D0L sequence equivalence problem (Q5951971) (← links)
- On infinite words generated by polynomial D0L systems (Q5957360) (← links)