| 2007 |
|---|
| 17 | EE | Taishin Y. Nishida:
Membrane Algorithm with Brownian Subalgorithm and Genetic Subalgorithm.
Int. J. Found. Comput. Sci. 18(6): 1353-1360 (2007) |
| 2005 |
|---|
| 16 | EE | Taishin Y. Nishida:
Membrane Algorithms.
Workshop on Membrane Computing 2005: 55-66 |
| 15 | | Taishin Y. Nishida:
Some New Aspects of Word-Length Controlled DT0L Systems.
Journal of Automata, Languages and Combinatorics 10(1): 61-77 (2005) |
| 2002 |
|---|
| 14 | EE | Jürgen Dassow,
Taishin Y. Nishida,
Bernd Reichel:
On the Descriptional Complexity of Some Variants of Lindenmayer Systems.
Developments in Language Theory 2002: 128-139 |
| 2001 |
|---|
| 13 | | Taishin Y. Nishida,
Shigeko Seki:
A Definition of Parikh Controlled Context-Free Grammars and Some Properties of Them.
Words, Semigroups, and Transductions 2001: 357-367 |
| 12 | | Taishin Y. Nishida:
Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems.
Journal of Automata, Languages and Combinatorics 6(4): 507-518 (2001) |
| 2000 |
|---|
| 11 | EE | Taishin Y. Nishida:
Multiset and K -Subset Transforming Systems.
WMP 2000: 255-266 |
| 10 | EE | Taishin Y. Nishida,
Arto Salomaa:
On slender 0L languages.
Theor. Comput. Sci. 233(1-2): 279-286 (2000) |
| 9 | EE | Taishin Y. Nishida,
Shigeko Seki:
Grouped partial ET0L systems and parallel multiple context-free grammars.
Theor. Comput. Sci. 246(1-2): 131-150 (2000) |
| 1999 |
|---|
| 8 | | Taishin Y. Nishida:
Word Length Controlled DT0L Systems and Slender Languages.
Jewels are Forever 1999: 213-221 |
| 1996 |
|---|
| 7 | | Yuji Takada,
Taishin Y. Nishida:
A note on grammatical inference of slender context-free languages.
ICGI 1996: 117-125 |
| 6 | EE | Taishin Y. Nishida,
Arto Salomaa:
Slender 0L Languages.
Theor. Comput. Sci. 158(1&2): 161-176 (1996) |
| 1995 |
|---|
| 5 | EE | Taishin Y. Nishida:
Quasi-Deterministic 0L Systems and Their Representation.
Theor. Comput. Sci. 147(1&2): 87-116 (1995) |
| 1994 |
|---|
| 4 | | Taishin Y. Nishida,
Youichi Kobuchi:
Invariant Sets for Substitution.
J. Comput. Syst. Sci. 49(2): 168-174 (1994) |
| 1992 |
|---|
| 3 | | Taishin Y. Nishida:
Quasi-Deterministic 0L Systems.
ICALP 1992: 65-76 |
| 1987 |
|---|
| 2 | | Taishin Y. Nishida,
Youichi Kobuchi:
Repeatable Words for Substitution.
Theor. Comput. Sci. 53: 319-333 (1987) |
| 1984 |
|---|
| 1 | | Jacques Sakarovitch,
Taishin Y. Nishida,
Youichi Kobuchi:
Recurrent Words for Substitution.
Mathematical Systems Theory 17(3): 199-215 (1984) |
