Satoshi Okawa

According to our database, Satoshi Okawa authored at least 17 papers between 1985 and 2023.

Collaborative distances:

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

2023

ChemPert: mapping between chemical perturbation and transcriptional response for non-cancer cells.

Menglin Zheng, Satoshi Okawa, Miren Bravo, Fei Chen, María L. Martínez-Chantar, Antonio del Sol

Nucleic Acids Res., January, 2023

2014

The firing squad synchronization problem with sub-generals.

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

Inf. Process. Lett., 2014

2013

On Context-Free Languages of Scattered Words.

Zoltán Ésik, Satoshi Okawa

Int. J. Found. Comput. Sci., 2013

2011

A Generalized Construction of Zero-Correlation Zone Sequence Set with Sequence Subsets.

Takafumi Hayashi, Takao Maeda, Satoshi Okawa

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

A Ternary Zero-Correlation Zone Sequence Set Having Wide Inter-Subset Zero-Correlation Zone.

Takafumi Hayashi, Takao Maeda, Shinya Matsufuji, Satoshi Okawa

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

2006

An extended star graph: a proposal of a new network topology and its fundamental properties.

Satoru Watanabe, Satoshi Okawa

Int. J. Comput. Sci. Eng., 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

Upper Bounds of the Correlation Functions of a Class of Binary Zero-Correlation-Zone Sequences.

Takafumi Hayashi, Takao Maeda, Satoshi Okawa

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

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

2001

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

Satoshi Okawa, Sadaki Hirose

Theor. Comput. Sci., 2001

A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages.

Pál Dömösi, Satoshi Okawa

Acta Cybern., 2001

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

Series and Parallel Operations on Pomsets.

Zoltán Ésik, Satoshi Okawa

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

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

A Homomorphic Characterization of Recursively Enumerable Languages.

Sadaki Hirose, Satoshi Okawa, Masaaki Yoneda

Theor. Comput. Sci., 1985