Keyword : tree automaton

Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
Toshinori TAKAI Hiroyuki SEKI Youhei FUJINAKA Yuichi KAJI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/02/01
Vol. E86-D  No. 2 ; pp. 285-295
Type of Manuscript:  Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: Term Rewriting Systems
Keyword: 
term rewriting system, tree automaton, recognizability, recognizability preserving property, layered transducing TRS, 
 Summary | Full Text:PDF(322.6KB)
Termination Property of Inverse Finite Path Overlapping Term Rewriting System is Decidable
Toshinori TAKAI Yuichi KAJI Hiroyuki SEKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2002/03/01
Vol. E85-D  No. 3 ; pp. 487-496
Type of Manuscript:  PAPER
Category: Theory/Models of Computation
Keyword: 
term rewriting system, termination, tree automaton, 
 Summary | Full Text:PDF(496KB)
Tree Automaton with Tree Memory
Ryuichi NAKANISHI Izumi HAYAKAWA Hiroyuki SEKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1998/02/25
Vol. E81-D  No. 2 ; pp. 161-170
Type of Manuscript:  PAPER
Category: Automata,Languages and Theory of Computing
Keyword: 
tree automaton,  tree automaton with tree memory, formal language, natural language, unification-based grammar, 
 Summary | Full Text:PDF(684.6KB)
Stack Tree Automata and Their Relation to Context-Free Grammars with Memory
Etsuro MORIYA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/10/25
Vol. E77-D  No. 10 ; pp. 1086-1093
Type of Manuscript:  PAPER
Category: Automata, Languages and Theory of Computing
Keyword: 
context-free grammar with memory, tree automaton, stack tree automaton, Thatcher's theorem, 
 Summary | Full Text:PDF(698.4KB)