Keyword : context-free tree grammar


Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata
Akio FUJIYOSHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/02/01
Vol. E92-D  No. 2 ; pp. 248-254
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
linear pushdown tree automatoncontext-free tree grammartree structurelinear-time recognizability
 Summary | Full Text:PDF

On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
Hiroyuki SEKI Yuki KATO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/02/01
Vol. E91-D  No. 2 ; pp. 209-221
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Formal Language Theory
Keyword: 
multiple context-free grammarmacro grammarcontext-free tree grammargenerative powerlinearity
 Summary | Full Text:PDF

Application of the CKY Algorithm to Recognition of Tree Structures for Linear, Monadic Context-Free Tree Grammars
Akio FUJIYOSHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/02/01
Vol. E90-D  No. 2 ; pp. 388-394
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Formal Languages
Keyword: 
formal languagesrecognition algorithmspine grammartree adjoining grammarcontext-free tree grammar
 Summary | Full Text:PDF

Analogical Conception of Chomsky Normal Form and Greibach Normal Form for Linear, Monadic Context-Free Tree Grammars
Akio FUJIYOSHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/12/01
Vol. E89-D  No. 12 ; pp. 2933-2938
Type of Manuscript:  PAPER
Category: Automata and Formal Language Theory
Keyword: 
formal languagestree adjoining grammarmildly context-sensitive grammarcontext-free tree grammar
 Summary | Full Text:PDF