tree transducers
Recently Published Documents


TOTAL DOCUMENTS

160
(FIVE YEARS 3)

H-INDEX

19
(FIVE YEARS 0)

Author(s):  
Raphaela Löbel ◽  
Michael Luttenberger ◽  
Helmut Seidl

A language over an alphabet [Formula: see text] of opening ([Formula: see text]) and closing ([Formula: see text]) brackets, is balanced if it is a subset of the Dyck language [Formula: see text] over [Formula: see text], and it is well-formed if all words are prefixes of words in [Formula: see text]. We show that well-formedness of a context-free language is decidable in polynomial time, and that the longest common reduced suffix can be computed in polynomial time. With this at a hand we decide for the class 2-TW of non-linear tree transducers with output alphabet [Formula: see text] whether or not the output language is balanced.





Author(s):  
Sebastian Maneth ◽  
Helmut Seidl ◽  
Martin Vu
Keyword(s):  
Top Down ◽  




Author(s):  
Raphaela Löbel ◽  
Michael Luttenberger ◽  
Helmut Seidl
Keyword(s):  


2019 ◽  
Author(s):  
Joost Engelfriet ◽  
Kazuhiro Inaba ◽  
Sebastian Maneth


2018 ◽  
Vol 29 (05) ◽  
pp. 877-892
Author(s):  
Andreas Maletti

The well-known synchronous context-free grammars (SCFGs) and synchronous tree-substitution grammars (STSGs), both of which are used as tree-to-tree translation models in statistical machine translation are investigated. Their composition hierarchies are established in both the unweighted as well as the weighted case. More precisely, it is shown that SCFGs are closed under composition in both cases and that there is a close connection between compositions of STSGs and compositions of certain tree transducers. With the help of the close ties, the composition closure of STSGs is identified in both cases as well. The results for the weighted case utilize a new lifting technique that might prove useful also in similar setups.



2018 ◽  
Vol 261 ◽  
pp. 311-335 ◽  
Author(s):  
Emmanuel Filiot ◽  
Sebastian Maneth ◽  
Pierre-Alain Reynier ◽  
Jean-Marc Talbot


2017 ◽  
Vol 64 (5) ◽  
pp. 1-55 ◽  
Author(s):  
Rajeev Alur ◽  
Loris D'antoni
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document