Ryuichi NAKANISHI


Computational Complexity of Finding Meaningful Association Rules
Yeon-Dae KWON Ryuichi NAKANISHI Minoru ITO Michio NAKANISHI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/09/25
Vol. E82-A  No. 9  pp. 1945-1952
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
data mininglarge itemsetmeaningful association rulecomputational complexitydatabase
 Summary | Full Text:PDF(529.4KB)

Efficient Recognition Algorithms for Parallel Multiple Context-Free Languages and for Multiple Context-Free Languages
Ryuichi NAKANISHI Keita TAKADA Hideki NII Hiroyuki SEKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1998/11/25
Vol. E81-D  No. 11  pp. 1148-1161
Type of Manuscript:  PAPER
Category: Automata,Languages and Theory of Computing
Keyword: 
parallel multiple context-free grammarmultiple context-free grammarboolean matrices multiplicationrecognition algorithmformal grammar
 Summary | Full Text:PDF(1MB)

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 memoryformal languagenatural languageunification-based grammar
 Summary | Full Text:PDF(684.6KB)

A Polynomial-Time Recognizable Subclass of Lexical-Functional Grammars
Sachiko ANDO Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/10/25
Vol. E77-D  No. 10  pp. 1067-1076
Type of Manuscript:  PAPER
Category: Automata, Languages and Theory of Computing
Keyword: 
lexical-functional grammarmodified head grammarformal languagegenerative capacity
 Summary | Full Text:PDF(754.6KB)

A Note on Inadequacy of the Model for Learning from Queries
Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/08/25
Vol. E77-D  No. 8  pp. 861-868
Type of Manuscript:  PAPER
Category: Automata, Languages and Theory of Computing
Keyword: 
computational learning theorylearning correctly from queriesformal languageextracting long counter example
 Summary | Full Text:PDF(715.1KB)

The Universal Recognition Problems for Parallel Multiple Context-Free Grammars and for Their Subclasses
Yuichi KAJI Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/07/25
Vol. E75-D  No. 4  pp. 499-508
Type of Manuscript:  PAPER
Category: Automaton, Language and Theory of Computing
Keyword: 
parallel multiple context-free grammarsuniversal recognition problemcomputational complexityformal language
 Summary | Full Text:PDF(810.4KB)

On the Generative Capacity of Lexical-Functional Grammars
Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/07/25
Vol. E75-D  No. 4  pp. 509-516
Type of Manuscript:  PAPER
Category: Automaton, Language and Theory of Computing
Keyword: 
lexical-functional grammarsformal languageautomatagenerative capacity
 Summary | Full Text:PDF(713.1KB)