24 citations · 39 across the 15 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.PL2015
Efficiently intertwining widening and narrowing
Gianluca Amato, Francesca Scozzari, Helmut Seidl +2
Non-trivial analysis problems require posets with infinite ascending and descending chains. In order to compute reasonably precise post-fixpoints of the resulting systems of equati…
cs.FL2015★ 3 cited
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable
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…