Satoshi Okawa

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