On the Balancedness of Tree-to-Word Transducers,International Journal of Foundations of Computer Science

当前位置： X-MOL 学术 › Int. J. Found. Comput. Sci. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

On the Balancedness of Tree-to-Word Transducers
International Journal of Foundations of Computer Science ( IF 0.6 ) Pub Date : 2021-07-14 , DOI: 10.1142/s0129054121420077
Raphaela Löbel ₁ , Michael Luttenberger ₁ , Helmut Seidl ₁

Affiliation

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 words in 𝔻B. 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 B whether or not the output language is balanced.

更新日期：2021-07-14

点击分享查看原文

点击收藏

公开下载

阅读更多本刊最新论文本刊介绍/投稿指南11