2 citations · 4 across the 3 of their papers we have counts for
4 papers
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…
Computing the longest common prefix of a context-free language in polynomial time
Michael Luttenberger, Raphaela Palenta, Helmut Seidl
We present two structural results concerning longest common prefixes of non-empty languages. First, we show that the longest common prefix of the language generated by a context-fr…
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
Adrien Boiret, Raphaela Palenta
We show that the equivalence of deterministic linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not nece…
A Map of Update Constraints in Inductive Inference
Timo Kötzing, Raphaela Palenta
We investigate how different learning restrictions reduce learning power and how the different restrictions relate to one another. We give a complete map for nine different restric…