Keyword : polynomial-time


NP-Hardness of Rotation Type Cell-Mazes
Shiro AOKI Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA Tsuyoshi HORINOUCHI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/03/25
Vol. E83-A  No. 3 ; pp. 492-496
Type of Manuscript:  Special Section LETTER (Special Section of Selected Papers from the 12th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
puzzlemazecomputational complexityNP-hardpolynomial-time
 Summary | Full Text:PDF(472.6KB)

Polynomial-Time Inference of Paralleled Even Monogenic Pure Context-Free Languages
Noriyuki TANIDA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1998/03/25
Vol. E81-D  No. 3 ; pp. 261-270
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
inductive inferenceparalleled even monogenic pure context-free languagespolynomial-time
 Summary | Full Text:PDF(827KB)

Inductive Inference of Monogenic Pure Context-Free Languages**
Noriyuki TANIDA Takashi YOKOMORI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1996/11/25
Vol. E79-D  No. 11 ; pp. 1503-1510
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
inductive inferencemonogenic pure context-free languagespolynomial-time
 Summary | Full Text:PDF(658KB)

Polynomial-Time Identification of Strictly Regular Languages in the Limit
Noriyuki TANIDA Takashi YOKOMORI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/01/25
Vol. E75-D  No. 1 ; pp. 125-132
Type of Manuscript:  Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category: 
Keyword: 
identificationstrictly regular languagepolynomial-time
 Summary | Full Text:PDF(614.1KB)