13 citations · 25 across the 16 of their papers we have counts for
1 paper · 1 filter
Helmut Seidl, Sebastian Maneth, Gregor Kemper
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present eff…