Satoshi Okawa

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 1

Top Topics

Cellular Automaton

Firing Squad Synchronization

Regular Languages

Top Venues

Inf. Process. Lett.

Int. J. Found. Comput. Sci.

Nucleic Acids Res.

Publications

Menglin Zheng, Satoshi Okawa, Miren Bravo, Fei Chen, María L. Martínez-Chantar, Antonio del Sol
ChemPert: mapping between chemical perturbation and transcriptional response for non-cancer cells. Nucleic Acids Res. 51 (D1) (2023)
Kazuya Yamashita, Yasuaki Nishitani, Sadaki Hirose, Satoshi Okawa, Nobuyasu Osato
The firing squad synchronization problem with sub-generals. Inf. Process. Lett. 114 (1-2) (2014)
Zoltán Ésik, Satoshi Okawa
On Context-Free Languages of Scattered Words. Int. J. Found. Comput. Sci. 24 (7) (2013)
Zoltán Ésik, Satoshi Okawa
On Context-Free Languages of Scattered Words. Developments in Language Theory (2012)
Takafumi Hayashi, Takao Maeda, Satoshi Okawa
A Generalized Construction of Zero-Correlation Zone Sequence Set with Sequence Subsets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (7) (2011)
Takafumi Hayashi, Takao Maeda, Shinya Matsufuji, Satoshi Okawa
A Ternary Zero-Correlation Zone Sequence Set Having Wide Inter-Subset Zero-Correlation Zone. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (11) (2011)
Zoltán Ésik, Satoshi Okawa
On context-free languages of scattered words CoRR (2011)
Satoshi Okawa, Sadaki Hirose
The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages. IEICE Trans. Inf. Syst. (10) (2006)
Satoru Watanabe, Satoshi Okawa
An extended star graph: a proposal of a new network topology and its fundamental properties. Int. J. Comput. Sci. Eng. 2 (1/2) (2006)
Sadaki Hirose, Satoshi Okawa
On Computational Power of Insertion-Deletion Systems without Using Contexts. IEICE Trans. Inf. Syst. (8) (2005)
Takafumi Hayashi, Takao Maeda, Satoshi Okawa
Upper Bounds of the Correlation Functions of a Class of Binary Zero-Correlation-Zone Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (3) (2005)
Sadaki Hirose, Satoshi Okawa
Characterizations of Language Classes: Universal Grammars, Dyck Reductions, and Homomorphisms. Grammars and Automata for String Processing (2003)
Satoru Watanabe, Satoshi Okawa
An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties. ISPA (2003)
Satoshi Okawa, Sadaki Hirose
Homomorphic characterizations of recursively enumerable languages with very small language classes. Theor. Comput. Sci. 250 (1-2) (2001)
Pál Dömösi, Satoshi Okawa
A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages. Acta Cybern. 15 (1) (2001)
Zoltán Ésik, Satoshi Okawa
Series and Parallel Operations on Pomsets. FSTTCS (1999)
Pál Dömösi, Satoshi Okawa, Sadaki Hirose
A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages. Bull. EATCS 68 (1999)
Satoshi Okawa, Sadaki Hirose
Subclasses of Linear Context - Free Languages and Homomorphic Characterizations of Languages. Systems and Computers in Japan 22 (5) (1991)
Satoshi Okawa, Sadaki Hirose, Masaaki Yoneda
On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages. Theor. Comput. Sci. 44 (1986)
Sadaki Hirose, Satoshi Okawa, Masaaki Yoneda
A Homomorphic Characterization of Recursively Enumerable Languages. Theor. Comput. Sci. 35 (1985)