Personal Information

Taishin Y. Nishida
Toyama Prefectural University
Here is my photo of X years ago(130KB)

Simulation program of Membrane Algorithm up 31 August 2005, version 1.0 beta (424kB, tar archive gzip compressed)

Research Interests

I am mainly interested in theoretical computer science. There are some other fields that attract me. The followings are titles of my papers. Clicking an item opens its abstract.
Theoretical Computer Science
Formal Language Theory, Lsystems, especially, varieties of 0L system and their properties
  1. Taishin Y. Nishida : A language for Artificial Life: A theory and an Implementation of a Parameterized 0L System Programming Language 8th Artificial Life and Robotics, Jan. 24--26, 2003, Beppu. Proc. AROB 2003 279--282
  2. J. Dassow, T. Nishida, and B. Reichel : On the descriptional complexity of some variants of Lindenmayer systems DLT2002 18 Sep. 2002, Kyoto; Pre-Proceedings: M. Ito and M. Toyama (eds) Developments in Language Theory, Kyoto Sangyo University, 140--158
  3. Taishin Y. Nishida: Sizes of conext-free languages generated by context-free grammars and stable and recurrent 0L systems Journal of Automata, Languages and Combinatorics, 6, 507--518, (2001)
  4. Taishin Y. Nishida and Shigeko Seki : A definition of Parikh controlled context-free grammars and some properties of them M.~Ito, Gh.~P\u aun, and S.~Yu (eds) Words, Semigroups, and Transductions, (World Scientifc 2001) 357--367
  5. Taishin Y. Nishida and Shigeko Seki : Grouped partial ET0L systems and parallel multiple context-free grammars Theoretical Computer Science, 246, 131--150, (2000)
  6. Taishin Y. Nishida : Comparisons of sizes of context-free languages among context-free grammars and 0L systems with stable and recurrent terminations D. Boldt and H. J\"urgensen (eds) Pre-Proceedings of DCAGRS 2000, Technical Report 555, Department of Computer Science, The University of Western Ontario (2000)
  7. Taishin Y. Nishida and Arto Salomaa: Note on slender 0L languages Theoretical Computer Science, 233, pp 279-286 (2000)
  8. Taishin Y. Nishida: Word length controlled DT0L systems and slender languages in: J. Karhumaeki, H. Maurer, G. Paun, and G. Rozenberg, ed., Jewels are Forever Contributions on Theoretical Computer Science in Honor of Arto Salomaa, Springer, Berlin, pp 213-221 (1999)
  9. Yuji Takada and Taishin Y. Nishida: A note on grammatical inference of slender context-tree languages in: L. Miclet and C. de la Higuer, ed., Grammatical Inference: Learning Syntax from Sentences, Lecture Notes in Artificial Intelligence, Vol. 1147, Springer, Berlin, pp 117-125 (1996)
  10. Taishin Y. Nishida and Arto Salomaa: Slender 0L languages Theoretical Computer Science, 158, pp 161-176 (1996)
  11. Taishin Y. Nishida: Quasi-deterministic 0L systems and their representation Theoretical Computer Science, 147, pp 87-116 (1995)
  12. Taishin Nishida and Youichi Kobuchi: Invariant sets for substitution Journal of Computer and System Science, 49, pp 168-174 (1994)
  13. Taishin Y. Nishida: Quasi-deterministic 0L systems in W. Kuich (ed.) Automata, Languages and Programming, LNCS 623, Springer-Verlag p 65-76 (1992) (Proceedings of the ICALP 92, 13 July 1992, Wien)
  14. Taishin Y. Nishida: Quasi-deterministic 0L systems (preliminary version, 2nd edition) SCCS Technical Report, 92-1-01, Chukyo University (1992) (This report will be sent on a request by an email)
Cellular Automata
  1. Taishin Nishida: A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel Computing In I. Nakata and M. Hagiya (eds): Software Science and Engineering, p16-38, World Scientific (1991)
Some other fields
Mathematical science or system science: mathematical analysis, with preferably discrete method, of complex phenomena emerged in living organisms, ecological systems, games, computing, economic or social systems, and so on.
  1. Taishin Y. Nishida: Simulations of photosynthesis by a $K$-subsest transforming system with membrane Fundamenta Informaticae, 49, 249--259, (2001)
  2. Taishin Y. Nishida : Multiset and K-subset transforming systems C.~S.~Calude, Gh.~P\u aun, G.~Rozenberg, and A.~Salomaa (eds) Multiset Processing LNCS 2235 (Springer Belrin 2001) 255--265
  3. Taishin Y. Nishida : Multiset and K-subset transforming systems: Nondeterministic model and probabilistic model Romanian Journal of Information Science and Technology, 4, 183--193, (2001)
  4. Taishin Y. Nishida and Yuji Takada : Variable length key stream cryptosystems SSGRR Computer and eBusiness Conference, Italy (2000)
  5. Taishin Y. Nishida : Multiset and K-subset transforming systems C. S. Calude, M. J. Dinneen, and J. Paun (eds) Pre-Proceedings of the Workshop on Multiset Processing, Research Report CDMTCS-140, University of Auckland (2000) 193--202
  6. T. Y. Nishida Description and Analysis of Food Webs Using Hyper Graphs (in Japanese) Bulletin of Toyama Prefectural University, 5, pp. 84-92 (1995)
  7. Developmental Models in Biology and Computer Science (in Japanese) Mathematical Science special issue on "Life, Information, and Mathematics", pp. 168-178 (1994)

Links

home
Artificial Life resources: directory of Artificial Life related websites.
A personal information of Taishin Yasunobu Nishida / nishida&pu-toyama.ac.jp (replace & with @ before sending)