Sadaki HIROSE


The Firing Squad Synchronization Problems for Number Patterns on a Seven-Segment Display and Segment Arrays
Kazuya YAMASHITA Mitsuru SAKAI Sadaki HIROSE Yasuaki NISHITANI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/12/01
Vol. E93-D  No. 12  pp. 3276-3283
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
firing squad synchronization problemcellular automatonseven-segment displaysegment treesegment array
 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

On Computational Power of Insertion-Deletion Systems without Using Contexts
Sadaki HIROSE Satoshi OKAWA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/08/01
Vol. E88-D  No. 8  pp. 1993-1995
Type of Manuscript:  LETTER
Category: Automata and Formal Language Theory
Keyword: 
Insertion-Deletion systemDNA computingformal languageautomaton
 Summary | Full Text:PDF

Some Relations between Watson-Crick Finite Automata and Chomsky Hierarchy
Sadaki HIROSE Kunifumi TSUDA Yasuhiro OGOSHI Haruhiko KIMURA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/05/01
Vol. E87-D  No. 5  pp. 1261-1264
Type of Manuscript:  LETTER
Category: Automata and Formal Language Theory
Keyword: 
Watson-Crick automatonDNA computingformal languageautomaton
 Summary | Full Text:PDF

Dyck Reductions are More Powerful Than Homomorphic Characterizations
Sadaki HIROSE Satoshi OKAWA Haruhiko KIMURA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1997/09/25
Vol. E80-D  No. 9  pp. 958-961
Type of Manuscript:  LETTER
Category: Automata,Languages and Theory of Computing
Keyword: 
Dyck languageDyck reductionhomomorphic characterization
 Summary | Full Text:PDF

Homomorphic Characterizations Are More Powerful Than Dyck Reductions
Sadaki HIROSE Satoshi OKAWA Haruhiko KIMURA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1997/03/25
Vol. E80-D  No. 3  pp. 390-392
Type of Manuscript:  LETTER
Category: Automata,Languages and Theory of Computing
Keyword: 
Dyck languageDyck reductionhomomorphic characterization
 Summary | Full Text:PDF

Dyck Reductions of Minimal Linear Languages Yield the Full Class of Recursively Enumerable Languages
Sadaki HIROSE Satoshi OKAWA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1996/02/25
Vol. E79-D  No. 2  pp. 161-164
Type of Manuscript:  LETTER
Category: Automata,Languages and Theory of Computing
Keyword: 
Dyck languageDyck reductionrecursively enumerable languageminimal linear language
 Summary | Full Text:PDF