A short solution for the HDT0L sequence equivalence problem
From MaRDI portal
Publication:1575723
DOI10.1016/S0304-3975(00)00158-4zbMath0945.68104MaRDI QIDQ1575723
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (18)
The equivalence problem for DF0L languages and power series. ⋮ Equality sets of binary D0L sequences ⋮ A new bound for the D0L sequence equivalence problem ⋮ Bounds for the D0L language equivalence problem ⋮ D0L sequence equivalence is inPfor fixed alphabets ⋮ Marked D0L systems and the \(2n\)-conjecture ⋮ The language equivalence problem for HD0L systems having D0L growths ⋮ On the Images of ℕ-Rational Sequences Counting Multiplicities ⋮ Easy cases of the D0L sequence equivalence problem ⋮ Unnamed Item ⋮ On infinite words generated by polynomial D0L systems ⋮ A Survey on Decidable Equivalence Problems for Tree Transducers ⋮ Streaming ranked-tree-to-string transducers ⋮ On infinite HD0L words having sparse letters ⋮ Copyful Streaming String Transducers ⋮ EQUALITY SETS OF MORPHIC WORD SEQUENCES ⋮ THE D0L ω-EQUIVALENCE PROBLEM ⋮ An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
Cites Work
This page was built for publication: A short solution for the HDT0L sequence equivalence problem
