Taishin Y. Nishida

26 papers A* 1C 1Journal 13Unranked 10
YearRankTypeTitle / Venue / Authors
2025 J jnl
Assembly membrane systems.
J. Membr. Comput.
Taishin Y. Nishida
2020 — conf
Evolutionary P Systems: The Notion and an Example.
Int. Conf. on Membrane Computing
Taishin Y. Nishida
2012 J jnl
An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules.
Theor. Comput. Sci.
Taishin Y. Nishida
2012 — conf
Earley's Parsing Algorithm and k-Petri Net Controlled Grammars.
Languages Alive
Taishin Y. Nishida
2009 J jnl
An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity.
J. Autom. Lang. Comb.
Taishin Y. Nishida
2008 — conf
An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity.
DCFS
Takashi Emori, Taishin Y. Nishida
2007 — conf
Descriptional Complexities of Grammars over Alphabets with Finite Parameters.
DCFS
Taishin Y. Nishida
2007 J jnl
Membrane Algorithm with Brownian Subalgorithm and Genetic Subalgorithm.
Int. J. Found. Comput. Sci.
Taishin Y. Nishida
2005 — conf
Membrane Algorithms.
Workshop on Membrane Computing
Taishin Y. Nishida
2005 J jnl
Some New Aspects of Word-Length Controlled DT0L Systems.
J. Autom. Lang. Comb.
Taishin Y. Nishida
2002 — conf
Descriptional complexities of grammars over alphabets with finite parameters.
DCFS
Taishin Y. Nishida
2002 C conf
On the Descriptional Complexity of Some Variants of Lindenmayer Systems.
Developments in Language Theory
Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel
2001 — conf
A Definition of Parikh Controlled Context-Free Grammars and Some Properties of Them.
Words, Semigroups, and Transductions
Taishin Y. Nishida, Shigeko Seki
2001 J jnl
Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems.
J. Autom. Lang. Comb.
Taishin Y. Nishida
2000 J jnl
Grouped partial ET0L systems and parallel multiple context-free grammars.
Theor. Comput. Sci.
Taishin Y. Nishida, Shigeko Seki
2000 — conf
Multiset and K -Subset Transforming Systems.
WMP
Taishin Y. Nishida
2000 J jnl
On slender 0L languages.
Theor. Comput. Sci.
Taishin Y. Nishida, Arto Salomaa
1999 — conf
Word Length Controlled DT0L Systems and Slender Languages.
Jewels are Forever
Taishin Y. Nishida
1996 — conf
A note on grammatical inference of slender context-free languages.
ICGI
Yuji Takada, Taishin Y. Nishida
1996 J jnl
Slender 0L Languages.
Theor. Comput. Sci.
Taishin Y. Nishida, Arto Salomaa
1995 J jnl
Quasi-Deterministic 0L Systems and Their Representation.
Theor. Comput. Sci.
Taishin Y. Nishida
1994 J jnl
Invariant Sets for Substitution.
J. Comput. Syst. Sci.
Taishin Y. Nishida, Youichi Kobuchi
1992 A* conf
Quasi-Deterministic 0L Systems.
ICALP
Taishin Y. Nishida
1991 — ch.
A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel Computing.
Software Science and Engineering
Taishin Y. Nishida
1987 J jnl
Repeatable Words for Substitution.
Theor. Comput. Sci.
Taishin Y. Nishida, Youichi Kobuchi
1984 J jnl
Recurrent Words for Substitution.
Math. Syst. Theory
Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi