24 citations · 39 across the 15 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.FL2019
On the Balancedness of Tree-to-word Transducers
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
A language over an alphabet of opening () and closing () brackets, is balanced if it is a subset of the Dyck language over , and…
cs.LO2019
How to Win First-Order Safety Games
Helmut Seidl, Christian Müller, Bernd Finkbeiner
First-order (FO) transition systems have recently attracted attention for the verification of parametric systems such as network protocols, software-defined networks or multi-agent…
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…