2006 |
15 | EE | Satoshi Okawa,
Sadaki Hirose:
The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages.
IEICE Transactions 89-D(10): 2591-2599 (2006) |
2005 |
14 | EE | Sadaki Hirose,
Satoshi Okawa:
On Computational Power of Insertion-Deletion Systems without Using Contexts.
IEICE Transactions 88-D(8): 1993-1995 (2005) |
2004 |
13 | EE | Makoto Koshino,
Tadashi Okamine,
Haruhiko Kimura,
Sadaki Hirose:
Improving heuristic function of cost-based abduction system using real-time heuristic search.
Systems and Computers in Japan 35(6): 89-97 (2004) |
2003 |
12 | | Sadaki Hirose,
Satoshi Okawa:
Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms.
Grammars and Automata for String Processing 2003: 253-262 |
11 | EE | Yasuhiro Ogoshi,
Haruhiko Kimura,
Sadaki Hirose,
Nobuyasu Osato:
Elevator group control system using multiagent system.
Systems and Computers in Japan 34(1): 45-58 (2003) |
2002 |
10 | EE | Haruhiko Kimura,
Sadaki Hirose,
Hidetaka Nambo:
High-speed consistency checking for hypothetical reasoning systems using inference path network.
Systems and Computers in Japan 33(9): 109-118 (2002) |
2001 |
9 | EE | Hidetaka Nambo,
Haruhiko Kimura,
Sadaki Hirose:
High-speed production system using dynamic two-way switching of match algorithm.
Systems and Computers in Japan 32(9): 61-70 (2001) |
8 | EE | Satoshi Okawa,
Sadaki Hirose:
Homomorphic characterizations of recursively enumerable languages with very small language classes.
Theor. Comput. Sci. 250(1-2): 55-69 (2001) |
1999 |
7 | | Pál Dömösi,
Satoshi Okawa,
Sadaki Hirose:
A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages.
Bulletin of the EATCS 68: 151 (1999) |
6 | EE | Hideaki Nobata,
Haruhiko Kimura,
Sadaki Hirose:
A proposal to reduce cumulative reasoning time in hypothetical reasoning.
Systems and Computers in Japan 30(12): 63-71 (1999) |
1997 |
5 | EE | Haruhiko Kimura,
Sadaki Hirose,
Kuniyasu Tajima:
High speed subsumption processing for hypothetical reasoning using inference-path networks.
Systems and Computers in Japan 28(12): 43-52 (1997) |
1986 |
4 | | Satoshi Okawa,
Sadaki Hirose,
Masaaki Yoneda:
On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages.
Theor. Comput. Sci. 44: 225-228 (1986) |
1985 |
3 | | Sadaki Hirose,
Satoshi Okawa,
Masaaki Yoneda:
A Homomorphic Characterization of Recursively Enumerable Languages.
Theor. Comput. Sci. 35: 261-269 (1985) |
2 | | Sadaki Hirose,
Masaaki Yoneda:
On the Chomsky and Stanley's Homomorphic Characterization of Context-Free Languages.
Theor. Comput. Sci. 36: 109-112 (1985) |
1981 |
1 | | Sadaki Hirose,
Masakazu Nasu:
Left Universal Context-Free Grammars and homomorphic Characterizations of Languages
Information and Control 50(2): 110-118 (1981) |