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

Etsuro Moriya

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)1086-1093
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE77-D
Issue number10
Publication statusPublished - 1994 Oct
Externally publishedYes

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Stack tree automata and their relation to context-free grammars with memory'. Together they form a unique fingerprint.

  • Cite this