Taishin Y. Nishida

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
j12		Taishin Y. Nishida: An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules. Theor. Comput. Sci. 448: 66-79 (2012)
c11		Taishin Y. Nishida: Earley's Parsing Algorithm and k-Petri Net Controlled Grammars. Languages Alive 2012: 174-185
	2009
j11		Taishin Y. Nishida: An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity. Journal of Automata, Languages and Combinatorics 14(2): 187-198 (2009)
	2008
c10		Takashi Emori, Taishin Y. Nishida: An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity. DCFS 2008: 157-167
	2007
j10		Taishin Y. Nishida: Membrane Algorithm with Brownian Subalgorithm and Genetic Subalgorithm. Int. J. Found. Comput. Sci. 18(6): 1353-1360 (2007)
c9		Taishin Y. Nishida: Descriptional Complexities of Grammars over Alphabets with Finite Parameters. DCFS 2007: 105-116
	2005
j9		Taishin Y. Nishida: Some New Aspects of Word-Length Controlled DT0L Systems. Journal of Automata, Languages and Combinatorics 10(1): 61-77 (2005)
c8		Taishin Y. Nishida: Membrane Algorithms. Workshop on Membrane Computing 2005: 55-66
	2002
c7		Taishin Y. Nishida: Descriptional complexities of grammars over alphabets with finite parameters. DCFS 2002: 246-255
c6		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
j8		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)
c5		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
	2000
j7		Taishin Y. Nishida, Arto Salomaa: On slender 0L languages. Theor. Comput. Sci. 233(1-2): 279-286 (2000)
j6		Taishin Y. Nishida, Shigeko Seki: Grouped partial ET0L systems and parallel multiple context-free grammars. Theor. Comput. Sci. 246(1-2): 131-150 (2000)
c4		Taishin Y. Nishida: Multiset and K -Subset Transforming Systems. WMP 2000: 255-266
	1999
c3		Taishin Y. Nishida: Word Length Controlled DT0L Systems and Slender Languages. Jewels are Forever 1999: 213-221
	1996
j5		Taishin Y. Nishida, Arto Salomaa: Slender 0L Languages. Theor. Comput. Sci. 158(1&2): 161-176 (1996)
c2		Yuji Takada, Taishin Y. Nishida: A note on grammatical inference of slender context-free languages. ICGI 1996: 117-125
	1995
j4		Taishin Y. Nishida: Quasi-Deterministic 0L Systems and Their Representation. Theor. Comput. Sci. 147(1&2): 87-116 (1995)
	1994
j3		Taishin Y. Nishida, Youichi Kobuchi: Invariant Sets for Substitution. J. Comput. Syst. Sci. 49(2): 168-174 (1994)
	1992
c1		Taishin Y. Nishida: Quasi-Deterministic 0L Systems. ICALP 1992: 65-76
	1987
j2		Taishin Y. Nishida, Youichi Kobuchi: Repeatable Words for Substitution. Theor. Comput. Sci. 53: 319-333 (1987)
	1984
j1		Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi: Recurrent Words for Substitution. Mathematical Systems Theory 17(3): 199-215 (1984)

Coauthor Index

1	Jürgen Dassow	[c6]
2	Takashi Emori	[c10]
3	Youichi Kobuchi	[j3] [j2] [j1]
4	Bernd Reichel	[c6]
5	Jacques Sakarovitch	[j1]
6	Arto Salomaa	[j7] [j5]
7	Shigeko Seki	[c5] [j6]
8	Yuji Takada	[c2]

Colors in the list of coauthors

Last update Thu May 23 01:22:00 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page