Taishin Y. Nishida

Publication Activity (10 Years)

Years Active: 1984-2020
Publications (10 Years): 1

Top Topics

Complex Systems

Optimal Solution

Top Venues

Int. Conf. on Membrane Computing

Languages Alive

Theor. Comput. Sci.

Publications

Taishin Y. Nishida
Evolutionary P Systems: The Notion and an Example. Int. Conf. on Membrane Computing (2020)
Taishin Y. Nishida
Earley's Parsing Algorithm and k-Petri Net Controlled Grammars. Languages Alive (2012)
Taishin Y. Nishida
An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules. Theor. Comput. Sci. 448 (2012)
Taishin Y. Nishida
An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity. J. Autom. Lang. Comb. 14 (2) (2009)
Takashi Emori, Taishin Y. Nishida
An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity. DCFS (2008)
Taishin Y. Nishida
Membrane Algorithm with Brownian Subalgorithm and Genetic Subalgorithm. Int. J. Found. Comput. Sci. 18 (6) (2007)
Taishin Y. Nishida
Descriptional Complexities of Grammars over Alphabets with Finite Parameters. DCFS (2007)
Taishin Y. Nishida
Some New Aspects of Word-Length Controlled DT0L Systems. J. Autom. Lang. Comb. 10 (1) (2005)
Taishin Y. Nishida
Membrane Algorithms. Workshop on Membrane Computing (2005)
Taishin Y. Nishida
Descriptional complexities of grammars over alphabets with finite parameters. DCFS (2002)
Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel
On the Descriptional Complexity of Some Variants of Lindenmayer Systems. Developments in Language Theory (2002)
Taishin Y. Nishida
Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems. J. Autom. Lang. Comb. 6 (4) (2001)
Taishin Y. Nishida, Shigeko Seki
A Definition of Parikh Controlled Context-Free Grammars and Some Properties of Them. Words, Semigroups, and Transductions (2001)
Taishin Y. Nishida, Arto Salomaa
On slender 0L languages. Theor. Comput. Sci. 233 (1-2) (2000)
Taishin Y. Nishida
Multiset and K -Subset Transforming Systems. WMP (2000)
Taishin Y. Nishida, Shigeko Seki
Grouped partial ET0L systems and parallel multiple context-free grammars. Theor. Comput. Sci. 246 (1-2) (2000)
Taishin Y. Nishida
Word Length Controlled DT0L Systems and Slender Languages. Jewels are Forever (1999)
Taishin Y. Nishida, Arto Salomaa
Slender 0L Languages. Theor. Comput. Sci. 158 (1&2) (1996)
Yuji Takada, Taishin Y. Nishida
A note on grammatical inference of slender context-free languages. ICGI (1996)
Taishin Y. Nishida
Quasi-Deterministic 0L Systems and Their Representation. Theor. Comput. Sci. 147 (1&2) (1995)
Taishin Y. Nishida, Youichi Kobuchi
Invariant Sets for Substitution. J. Comput. Syst. Sci. 49 (2) (1994)
Taishin Y. Nishida
Quasi-Deterministic 0L Systems. ICALP (1992)
Taishin Y. Nishida, Youichi Kobuchi
Repeatable Words for Substitution. Theor. Comput. Sci. 53 (1987)
Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi
Recurrent Words for Substitution. Math. Syst. Theory 17 (3) (1984)