Keyword : formal languages


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

The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages
Satoshi OKAWA Sadaki HIROSE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/10/01
Vol. E89-D  No. 10 ; pp. 2591-2599
Type of Manuscript:  PAPER
Category: Automata and Formal Language Theory
Keyword: 
DNA computerWatson-Crick automataformal languageslanguage family
 Summary | Full Text:PDF

Finite State Translation Systems and Parallel Multiple Context-Free Grammars
Yuichi KAJI Hiroyuki SEKI Tadao KASAMI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/06/25
Vol. E77-D  No. 6 ; pp. 619-630
Type of Manuscript:  PAPER
Category: Automata, Languages and Theory of Computing
Keyword: 
finite state translation systemsparallel multiple context-free grammarstree automatacomputational complexityformal languages
 Summary | Full Text:PDF