On the Balancedness of Tree-to-Word Transducers

A language over an alphabet B = A ∪A¯ of opening (A) and closing (A¯) brackets, is balanced if it is a subset of the Dyck language 𝔻B over B, and it is well-formed if all words are prefixes of word...