Sadaki Hirose

According to our database, Sadaki Hirose authored at least 20 papers between 1981 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2014

The firing squad synchronization problem with sub-generals.

Kazuya Yamashita, Yasuaki Nishitani, Sadaki Hirose, Satoshi Okawa, Nobuyasu Osato

Inf. Process. Lett., 2014

2010

The Firing Squad Synchronization Problems for Number Patterns on a Seven-Segment Display and Segment Arrays.

Kazuya Yamashita, Mitsuru Sakai, Sadaki Hirose, Yasuaki Nishitani

IEICE Trans. Inf. Syst., 2010

2006

The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages.

Satoshi Okawa, Sadaki Hirose

IEICE Trans. Inf. Syst., 2006

2005

On Computational Power of Insertion-Deletion Systems without Using Contexts.

Sadaki Hirose, Satoshi Okawa

IEICE Trans. Inf. Syst., 2005

2004

Improving heuristic function of cost-based abduction system using real-time heuristic search.

Makoto Koshino, Tadashi Okamine, Haruhiko Kimura, Sadaki Hirose

Syst. Comput. Jpn., 2004

Some Relations between Watson-Crick Finite Automata and Chomsky Hierarchy.

Sadaki Hirose, Kunifumi Tsuda, Yasuhiro Ogoshi, Haruhiko Kimura

IEICE Trans. Inf. Syst., 2004

2003

Elevator group control system using multiagent system.

Yasuhiro Ogoshi, Haruhiko Kimura, Sadaki Hirose, Nobuyasu Osato

Syst. Comput. Jpn., 2003

Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms.

Sadaki Hirose, Satoshi Okawa

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002

High-speed consistency checking for hypothetical reasoning systems using inference path network.

Haruhiko Kimura, Sadaki Hirose, Hidetaka Nambo

Syst. Comput. Jpn., 2002

2001

Homomorphic characterizations of recursively enumerable languages with very small language classes.

Satoshi Okawa, Sadaki Hirose

Theor. Comput. Sci., 2001

High-speed production system using dynamic two-way switching of match algorithm.

Hidetaka Nambo, Haruhiko Kimura, Sadaki Hirose

Syst. Comput. Jpn., 2001

1999

A proposal to reduce cumulative reasoning time in hypothetical reasoning.

Hideaki Nobata, Haruhiko Kimura, Sadaki Hirose

Syst. Comput. Jpn., 1999

A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages.

Pál Dömösi, Satoshi Okawa, Sadaki Hirose

Bull. EATCS, 1999

1997

High speed subsumption processing for hypothetical reasoning using inference-path networks.

Haruhiko Kimura, Sadaki Hirose, Kuniyasu Tajima

Syst. Comput. Jpn., 1997

1991

Subclasses of Linear Context - Free Languages and Homomorphic Characterizations of Languages.

Satoshi Okawa, Sadaki Hirose

Syst. Comput. Jpn., 1991

1986

On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages.

Satoshi Okawa, Sadaki Hirose, Masaaki Yoneda

Theor. Comput. Sci., 1986

1985

On the Chomsky and Stanley's Homomorphic Characterization of Context-Free Languages.

Sadaki Hirose, Masaaki Yoneda

Theor. Comput. Sci., 1985

A Homomorphic Characterization of Recursively Enumerable Languages.

Sadaki Hirose, Satoshi Okawa, Masaaki Yoneda

Theor. Comput. Sci., 1985

1982

An interactive logic synthesis system based upon AI techniques.

Nobuaki Kawato, Takao Uehara, Sadaki Hirose, Takao Saito

Proceedings of the 19th Design Automation Conference, 1982

1981

Left Universal Context-Free Grammars and homomorphic Characterizations of Languages

Sadaki Hirose, Masakazu Nasu

Inf. Control., August, 1981