default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaishin Y. Nishida
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c12]Taishin Y. Nishida
:
Evolutionary P Systems: The Notion and an Example. Int. Conf. on Membrane Computing 2020: 126-134
2010 – 2019
- 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
2000 – 2009
- 2009
- [j11]Taishin Y. Nishida:
An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity. J. Autom. Lang. Comb. 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. J. Autom. Lang. Comb. 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. J. Autom. Lang. Comb. 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
1990 – 1999
- 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 - 1991
- [p1]Taishin Y. Nishida:
A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel Computing. Software Science and Engineering 1991: 16-38
1980 – 1989
- 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. Math. Syst. Theory 17(3): 199-215 (1984)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
