On the Class of Predicates Decidable by Two-Way Multitape Finite Automata. - Kojiro Kobayashi; Shigeru Sekiguchi (J. ACM, 1966)

Some Unsolvable Problems on Context-Free Languages and Their Application to On-Line Language Recognizers - Kojiro Kobayashi (Inf. Control., 1968)

Classification of Formal Languages by Functional Binary Transductions - Kojiro Kobayashi (Inf. Control., 1969)

Structural Complexity of Context-Free Languages - Kojiro Kobayashi (Inf. Control., 1971)

A Note on Extending Equivalence Theories of Algorithms. - Kojiro Kobayashi (Inf. Process. Lett., 1974)

The Firing Squad Synchronization Problem for Two-Dimensional Arrays - Kojiro Kobayashi (Inf. Control., 1977)

The Firing Squad Synchronization Problem for a Class of Polyautomata Networks. - Kojiro Kobayashi (J. Comput. Syst. Sci., 1978)

On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks. - Kojiro Kobayashi (Theor. Comput. Sci., 1978)

Logical formulas and four subclasses of omega-regular languages. - Kojiro Kobayashi; Masako Takahashi; Hideki Yamasaki (Automata on Infinite Words, 1984)

Characterization of omega-Regular Languages by First-Order Formulas. - Kojiro Kobayashi; Masako Takahashi; Hideki Yamasaki (Theor. Comput. Sci., 1984)

On Proving Time Constructibility of Functions. - Kojiro Kobayashi (Theor. Comput. Sci., 1985)

On the structure of one-tape nondeterministic turing machine time hierarchy. - Kojiro Kobayashi (Theor. Comput. Sci., 1985)

Characterization of omega-Regular Languages by Monadic Second-Order Formulas. - Hideki Yamasaki; Masako Takahashi; Kojiro Kobayashi (Theor. Comput. Sci., 1986)

On Malign Input Distributions for Algorithms. - Kojiro Kobayashi (ISAAC, 1992)

Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness. - Kojiro Kobayashi (Inf. Process. Lett., 1993)

On Coding Theorems with Modified Length Functions. - Kojiro Kobayashi (Logic, Language and Computation, 1994)

Transformations that Preserve Malignness of Universal Distributions. - Kojiro Kobayashi (Theor. Comput. Sci., 1997)

The Kolmogorov complexity, universal distribution, and coding theorem for generalized length functions. - Kojiro Kobayashi (IEEE Trans. Inf. Theory, 1997)

On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. - Kojiro Kobayashi (Theor. Comput. Sci., 2001)

On Formulations of Firing Squad Synchronization Problems. - Kojiro Kobayashi; Darin Goldstein (UC, 2005)

On the Complexity of Network Synchronization. - Darin Goldstein; Kojiro Kobayashi (SIAM J. Comput., 2005)

On the Complexity of the "Most General" Firing Squad Synchronization Problem. - Darin Goldstein; Kojiro Kobayashi (STACS, 2006)

On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem. - Darin Goldstein; Kojiro Kobayashi (ISAAC, 2007)

On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation. - Takashi Saso; Kojiro Kobayashi; Atsuyoshi Nakamura (Inf. Process. Lett., 2011)

On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks. - Darin Goldstein; Kojiro Kobayashi (SIAM J. Comput., 2012)

The minimum firing time of the generalized firing squad synchronization problem for squares. - Kojiro Kobayashi (Theor. Comput. Sci., 2014)

Evaluation on mechanical impact parameters in piezoelectric power generation. - Amat A. Basari; Sosuke Awaji; Shintaro Sakamoto; Seiji Hashimoto; Bunji Homma; Kenji Suto; Hiroaki Okada; Hideki Okuno; Kojiro Kobayashi; Shunji Kumagai (ASCC, 2015)

Minimum firing times of firing squad synchronization problems for paths in grid spaces. - Kojiro Kobayashi (CoRR, 2019)

The firing squad synchronization problem for squares with holes. - Kojiro Kobayashi (CoRR, 2019)

Nonexistence of Minimal-time Solutions for Some Variations of the Firing Squad Synchronization Problem having Simple Geometric Configurations. - Kojiro Kobayashi (J. Cell. Autom., 2019)