Recurrent Words for Substitution. - Jacques Sakarovitch; Taishin Y. Nishida; Youichi Kobuchi (Math. Syst. Theory, 1984)

Repeatable Words for Substitution. - Taishin Y. Nishida; Youichi Kobuchi (Theor. Comput. Sci., 1987)

A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel Computing. - Taishin Y. Nishida (Software Science and Engineering, 1991)

Quasi-Deterministic 0L Systems. - Taishin Y. Nishida (ICALP, 1992)

Invariant Sets for Substitution. - Taishin Y. Nishida; Youichi Kobuchi (J. Comput. Syst. Sci., 1994)

Quasi-Deterministic 0L Systems and Their Representation. - Taishin Y. Nishida (Theor. Comput. Sci., 1995)

A note on grammatical inference of slender context-free languages. - Yuji Takada; Taishin Y. Nishida (ICGI, 1996)

Word Length Controlled DT0L Systems and Slender Languages. - Taishin Y. Nishida (Jewels are Forever, 1999)

Multiset and K -Subset Transforming Systems. - Taishin Y. Nishida (WMP, 2000)

On slender 0L languages. - Taishin Y. Nishida; Arto Salomaa (Theor. Comput. Sci., 2000)

Grouped partial ET0L systems and parallel multiple context-free grammars. - Taishin Y. Nishida; Shigeko Seki (Theor. Comput. Sci., 2000)

A Definition of Parikh Controlled Context-Free Grammars and Some Properties of Them. - Taishin Y. Nishida; Shigeko Seki (Words, Semigroups, and Transductions, 2001)

Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems. - Taishin Y. Nishida (J. Autom. Lang. Comb., 2001)

On the Descriptional Complexity of Some Variants of Lindenmayer Systems. - Jürgen Dassow; Taishin Y. Nishida; Bernd Reichel (Developments in Language Theory, 2002)

Membrane Algorithms. - Taishin Y. Nishida (Workshop on Membrane Computing, 2005)

Some New Aspects of Word-Length Controlled DT0L Systems. - Taishin Y. Nishida (J. Autom. Lang. Comb., 2005)

Descriptional Complexities of Grammars over Alphabets with Finite Parameters. - Taishin Y. Nishida (DCFS, 2007)

Membrane Algorithm with Brownian Subalgorithm and Genetic Subalgorithm. - Taishin Y. Nishida (Int. J. Found. Comput. Sci., 2007)

An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity. - Takashi Emori; Taishin Y. Nishida (DCFS, 2008)

An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity. - Taishin Y. Nishida (J. Autom. Lang. Comb., 2009)

Earley's Parsing Algorithm and k-Petri Net Controlled Grammars. - Taishin Y. Nishida (Languages Alive, 2012)

An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules. - Taishin Y. Nishida (Theor. Comput. Sci., 2012)

Evolutionary P Systems: The Notion and an Example. - Taishin Y. Nishida (Int. Conf. on Membrane Computing, 2020)