activity
20142019
most citedDeciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

2 citations · 4 across the 3 of their papers we have counts for

collaborators
Showing 2019 · cs.FLShow all

1 paper · 2 filters

cs.FL2019

Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time

Helmut Seidl, Raphaela Palenta, Sebastian Maneth

In 1982, Courcelle and Franchi-Zannettacci showed that the equivalence problem of separated non-nested attribute systems can be reduced to the equivalence problem of total determin…