As a generalization of the tree automation, 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.
|ジャーナル||IEICE Transactions on Information and Systems|
|出版ステータス||Published - 1994 10月|
ASJC Scopus subject areas
- コンピュータ グラフィックスおよびコンピュータ支援設計