Tetsuro NISHINO


FOREWORD
Tetsuro NISHINO Yasuhiko TAKENAGA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/01/01
Vol. E88-D  No. 1  pp. 10-11
Type of Manuscript:  FOREWORD
Category: 
Keyword: 
 Summary | Full Text:PDF

Relationships between the Computational Capabilities of Simple Recurrent Networks and Finite Automata
Junnosuke MORIYA Tetsuro NISHINO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/05/01
Vol. E84-A  No. 5  pp. 1184-1194
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
neural networksimple recurrent networkElman machineMealy machineMoore machine
 Summary | Full Text:PDF

The Complexity of Threshold Circuits for Parity Functions
Shao-Chin SUNG Tetsuro NISHINO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1997/01/25
Vol. E80-D  No. 1  pp. 91-93
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
computational complexitythreshold circuitparity function
 Summary | Full Text:PDF

A Relationship between the Number of Negations and the Circuit Size
Keisuke TANAKA Tetsuro NISHINO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1996/09/25
Vol. E79-D  No. 9  pp. 1355-1357
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
computational complexitytheory of computation
 Summary | Full Text:PDF

Recognition of Devanagari Characters Using Neural Networks
Kanad KEENI Hiroshi SHIMODAIRA Tetsuro NISHINO Yasuo TAN 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1996/05/25
Vol. E79-D  No. 5  pp. 523-528
Type of Manuscript:  Special Section PAPER (Special Issue on Character Recognition and Document Understanding)
Category: Neural Networks
Keyword: 
character recognitionneural networksstructure analysisheuristic codingfeature vectorprototype vector
 Summary | Full Text:PDF

On the Number of Negations Needed to Compute Parity Functions
Tetsuro NISHINO Jaikumar RADHAKRISHNAN 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1995/01/25
Vol. E78-D  No. 1  pp. 90-91
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
computational complexityboolean circuitparity function
 Summary | Full Text:PDF

On the Negation-Limited Circuit Complexity of Clique Functions
Tetsuro NISHINO Keisuke TANAKA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1995/01/25
Vol. E78-D  No. 1  pp. 86-89
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
computational complexityboolean circuitclique function
 Summary | Full Text:PDF

A Simulation Result for Simultaneously Bounded AuxPDAs
Tetsuro NISHINO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/06/25
Vol. E77-D  No. 6  pp. 720-722
Type of Manuscript:  LETTER
Category: Automata, Languages and Theory of Computing
Keyword: 
automatonlanguage and theory of computing
 Summary | Full Text:PDF

The Emptiness Problem for Lexical-Functional Grammars is Undecidable
Tetsuro NISHINO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/05/25
Vol. E77-D  No. 5  pp. 597-600
Type of Manuscript:  LETTER
Category: Automata, Languages and Theory of Computing
Keyword: 
formal grammarlanguage and theory of computing
 Summary | Full Text:PDF