Stack Tree Automata and Their Relation to Context-Free Grammars with Memory

スポンサーリンク

概要

• 論文の詳細を見る

• As a generalization of the tree automaton, tree automata with various types of memory are introduced and their relation to context-free grammars with memory is studied. Relations between computation trees of tree automata with memory and derivation trees of context-free grammars with memory are established, and as a consequence, the languages generated by context-free grammars with memory are characterized in terms of the sets of trees recognizable by tree automata with memory. Also various types of traversal of labeled trees recognizable by tree automata with memory are considered.

• 一般社団法人電子情報通信学会の論文
• 1994-10-25

著者

• MORIYA Etsuro

  Department of Mathematics, School of Education, Waseda University

• Moriya E

  Waseda Univ. Tokyo Jpn

• Moriya Etsuro

  Department Of Mathematics School Of Education Waseda University

関連論文

• Shrinking Alternating Two-Pushdown Automata(Automata and Formal Language Theory)
• Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata(Automata and Formal Language Theory)
• Stack Tree Automata and Their Relation to Context-Free Grammars with Memory

スポンサーリンク