Some Notes on Domain Tree Languages of Top-Down Pushdown Tree Transducers

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, some properties of domain tree languages of top-down pushdown tree transducers (domain(t-PDTT) or t-PDTT_D)are shown. It is shown that (1)for any L_1, L_2 in context-free language(CFL), L_1∩L_2∈yield_e(t-PDTT_D)(where yield_e is an extended yield), (2)yield_e(t-PDTT^<ε_0>_<D_F>)is closed under homomorphisms, where t-PDTT^<ε_0> is at PDTT which can not proceed generations after reading a constant symbol σ and t-PDTT^<ε_0>_<D_F>) denotes a domain tree language of t-PDTT^<ε_0> with a final state translation, and (3)yield_e(t-PDTT^<ε_0>_<D_F>)is the class of recursively enumerable languages, and consequently yield_e(t-PDTT_D)is the class of recursively enumerable languages.

• 社団法人電子情報通信学会の論文
• 2000-09-25

著者

• Yamasaki Katsunori

  Department Of Information Sciences Faculty Of Science And Technology Science University Of Tokyo

関連論文

• Some Notes on Domain Tree Languages of Top-Down Pushdown Tree Transducers

スポンサーリンク