Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
arxiv(2023)
摘要
We prove that for a given partial functional attributed tree transducer with
monadic output, it is decidable whether or not an equivalent top-down
transducer (with or without look-ahead) exists. We present a procedure that
constructs an equivalent top-down transducer (with or without look-ahead) if it
exists.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要