Stack tree automata and their relation to context-free grammars with memory

Etsuro Moriya

研究成果: Article査読

抄録

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.

本文言語English
ページ(範囲)1086-1093
ページ数8
ジャーナルIEICE Transactions on Information and Systems
E77-D
10
出版ステータスPublished - 1994 10
外部発表はい

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Information Systems
  • Software

フィンガープリント 「Stack tree automata and their relation to context-free grammars with memory」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル