Taishin Y. Nishida - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2020

Evolutionary P Systems: The Notion and an ExampleTaishin Y. Nishida. membrane 2021: 126-134 [doi]

2012

Earley's Parsing Algorithm and k-Petri Net Controlled GrammarsTaishin Y. Nishida. BIRTHDAY 2012: 174-185 [doi]

An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rulesTaishin Y. Nishida. TCS, 448:66-79, 2012. [doi]

2009

An Efficient Derivation Method for DT0L Systems and a Measure of Derivation ComplexityTaishin Y. Nishida. jalc, 14(2):187-198, 2009.

2008

An Efficient Derivation Method for DTOL Systems and a Measure of Derivation ComplexityTakashi Emori, Taishin Y. Nishida. dcfs 2008: 157-167

2007

Membrane Algorithm with Brownian Subalgorithm and Genetic SubalgorithmTaishin Y. Nishida. ijfcs, 18(6):1353-1360, 2007. [doi]

Descriptional Complexities of Grammars over Alphabets with Finite ParametersTaishin Y. Nishida. dcfs 2007: 105-116

2005

Some New Aspects of Word-Length Controlled DT0L SystemsTaishin Y. Nishida. jalc, 10(1):61-77, 2005.

Membrane AlgorithmsTaishin Y. Nishida. membrane 2006: 55-66 [doi]

2002

On the Descriptional Complexity of Some Variants of Lindenmayer SystemsJürgen Dassow, Taishin Y. Nishida, Bernd Reichel. dlt 2003: 128-139 [doi]

Descriptional complexities of grammars over alphabets with finite parametersTaishin Y. Nishida. dcfs 2002: 246-255

2001

Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L SystemsTaishin Y. Nishida. jalc, 6(4):507-518, 2001.

A Definition of Parikh Controlled Context-Free Grammars and Some Properties of ThemTaishin Y. Nishida, Shigeko Seki. BIRTHDAY 2001: 357-367

2000

Multiset and K -Subset Transforming SystemsTaishin Y. Nishida. wmpi 2001: 255-266 [doi]

Grouped partial ET0L systems and parallel multiple context-free grammarsTaishin Y. Nishida, Shigeko Seki. TCS, 246(1-2):131-150, 2000. [doi]

On slender 0L languagesTaishin Y. Nishida, Arto Salomaa. TCS, 233(1-2):279-286, 2000. [doi]

1999

Word Length Controlled DT0L Systems and Slender LanguagesTaishin Y. Nishida. BIRTHDAY 1999: 213-221

1996

Slender 0L LanguagesTaishin Y. Nishida, Arto Salomaa. TCS, 158(1&2):161-176, 1996. [doi]

A note on grammatical inference of slender context-free languagesYuji Takada, Taishin Y. Nishida. icgi 1996: 117-125

1995

Quasi-Deterministic 0L Systems and Their RepresentationTaishin Y. Nishida. TCS, 147(1&2):87-116, 1995. [doi]

1994

Invariant Sets for SubstitutionTaishin Y. Nishida, Youichi Kobuchi. jcss, 49(2):168-174, 1994.

1992

Quasi-Deterministic 0L SystemsTaishin Y. Nishida. icalp 1992: 65-76

1991

A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel ComputingTaishin Y. Nishida. In Ikuo Nakata, Masami Hagiya, editors, Software Science and Engineering: Selected Papers from the Kyoto Symposia. Volume 31 of World Scientific Series in Computer Science, pages 16-38, World Scientific, 1991. [doi]

1987

Repeatable Words for SubstitutionTaishin Y. Nishida, Youichi Kobuchi. TCS, 53:319-333, 1987.

1984

Recurrent Words for SubstitutionJacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi. mst, 17(3):199-215, 1984.

Sign in or sign up to see more results.

runs on WebDSL