Taishin Y. Nishida

According to our database, Taishin Y. Nishida authored at least 23 papers between 1984 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Evolutionary P Systems: The Notion and an Example.

Taishin Y. Nishida

Proceedings of the Membrane Computing, 2020

2012

An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules.

Taishin Y. Nishida

Theor. Comput. Sci., 2012

Earley's Parsing Algorithm and k-Petri Net Controlled Grammars.

Taishin Y. Nishida

Proceedings of the Languages Alive, 2012

2009

An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity.

Taishin Y. Nishida

J. Autom. Lang. Comb., 2009

2008

An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity.

Takashi Emori, Taishin Y. Nishida

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

Membrane Algorithm with Brownian Subalgorithm and Genetic Subalgorithm.

Taishin Y. Nishida

Int. J. Found. Comput. Sci., 2007

Descriptional Complexities of Grammars over Alphabets with Finite Parameters.

Taishin Y. Nishida

Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

2005

Some New Aspects of Word-Length Controlled DT0L Systems.

Taishin Y. Nishida

J. Autom. Lang. Comb., 2005

Membrane Algorithms.

Taishin Y. Nishida

Proceedings of the Membrane Computing, 6th International Workshop, 2005

2002

On the Descriptional Complexity of Some Variants of Lindenmayer Systems.

Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems.

Taishin Y. Nishida

J. Autom. Lang. Comb., 2001

A Definition of Parikh Controlled Context-Free Grammars and Some Properties of Them.

Taishin Y. Nishida, Shigeko Seki

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

Grouped partial ET0L systems and parallel multiple context-free grammars.

Taishin Y. Nishida, Shigeko Seki

Theor. Comput. Sci., 2000

Multiset and K -Subset Transforming Systems.

Taishin Y. Nishida

Proceedings of the Multiset Processing, 2000

1999

Word Length Controlled DT0L Systems and Slender Languages.

Taishin Y. Nishida

Proceedings of the Jewels are Forever, 1999

1996

Slender 0L Languages.

Taishin Y. Nishida, Arto Salomaa

Theor. Comput. Sci., 1996

A note on grammatical inference of slender context-free languages.

Yuji Takada, Taishin Y. Nishida

Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

1995

Quasi-Deterministic 0L Systems and Their Representation.

Taishin Y. Nishida

Theor. Comput. Sci., 1995

1994

Invariant Sets for Substitution.

Taishin Y. Nishida, Youichi Kobuchi

J. Comput. Syst. Sci., 1994

1992

Quasi-Deterministic 0L Systems.

Taishin Y. Nishida

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel Computing.

Taishin Y. Nishida

Proceedings of the Software Science and Engineering: Selected Papers from the Kyoto Symposia, 1991

1987

Repeatable Words for Substitution.

Taishin Y. Nishida, Youichi Kobuchi

Theor. Comput. Sci., 1987

1984

Recurrent Words for Substitution.

Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi

Math. Syst. Theory, 1984