DC Field
Value
Language
dc.contributor.author
Alhazov, Artiom
-
dc.contributor.author
Freund, Rudolf
-
dc.contributor.author
Ivanov, Sergiu
-
dc.contributor.author
Oswald, Marion
-
dc.date.accessioned
2022-11-21T15:00:45Z
-
dc.date.available
2022-11-21T15:00:45Z
-
dc.date.issued
2022-06-12
-
dc.identifier.citation
<div class="csl-bib-body"> <div class="csl-entry">Alhazov, A., Freund, R., Ivanov, S., &#38; Oswald, M. (2022). Variants of derivation modes for which purely catalytic {P} systemsare computationally complete. <i>Theoretical Computer Science</i>, <i>920</i>, 95–112. https://doi.org/10.1016/j.tcs.2022.03.007</div> </div>
-
dc.identifier.issn
0304-3975
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/135854
-
dc.language.iso
en
-
dc.publisher
Elsevier
-
dc.relation.ispartof
Theoretical Computer Science
-
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
-
dc.subject
Catalysts
en
dc.subject
Computational completeness
en
dc.subject
Derivation modes
en
dc.subject
Purely catalytic P systems
en
dc.title
Variants of derivation modes for which purely catalytic {P} systemsare computationally complete
en
dc.type
Article
en
dc.type
Artikel
de
dc.rights.license
Creative Commons Namensnennung 4.0 International
de
dc.rights.license
Creative Commons Attribution 4.0 International
en
dc.identifier.url
https://doi.org/10.1016/j.tcs.2022.03.007
-
dc.contributor.affiliation
Academy of Sciences of Moldova, Moldova (the Republic of)
-
dc.contributor.affiliation
University of Paris-Saclay, France
-
dc.description.startpage
95
-
dc.description.endpage
112
-
dcterms.dateSubmitted
2021-08-27
-
dc.rights.holder
© 2022 The Author(s)
-
dc.type.category
Original Research Article
-
tuw.container.volume
920
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
wb.publication.intCoWork
International Co-publication
-
tuw.researchTopic.id
C5
-
tuw.researchTopic.name
Computer Science Foundations
-
tuw.researchTopic.value
100
-
dcterms.isPartOf.title
Theoretical Computer Science
-
tuw.publication.orgunit
E192-05 - Forschungsbereich Theory and Logic
-
tuw.publisher.doi
10.1016/j.tcs.2022.03.007
-
dc.date.onlinefirst
2022-05-12
-
dc.identifier.eissn
1879-2294
-
dc.identifier.libraryid
AC17203576
-
dc.description.numberOfPages
18
-
tuw.author.orcid
0000-0002-6184-3971
-
tuw.author.orcid
0000-0003-1255-1953
-
dc.rights.identifier
CC BY 4.0
de
dc.rights.identifier
CC BY 4.0
en
dc.description.sponsorshipexternal
National Agency for Research and Development
-
dc.description.sponsorshipexternal
DIM RFSI
-
dc.relation.grantnoexternal
20.80009.5007.22
-
dc.relation.grantnoexternal
2018-03
-
wb.sci
true
-
wb.sciencebranch
Informatik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.value
100
-
item.grantfulltext
open
-
item.openairecristype
http://purl.org/coar/resource_type/c_2df8fbb1
-
item.mimetype
application/pdf
-
item.openairetype
research article
-
item.openaccessfulltext
Open Access
-
item.languageiso639-1
en
-
item.cerifentitytype
Publications
-
item.fulltext
with Fulltext
-
crisitem.author.dept
Moldova State University
-
crisitem.author.dept
E192-05 - Forschungsbereich Theory and Logic
-
crisitem.author.dept
Université Paris-Saclay
-
crisitem.author.dept
E192 - Institut für Logic and Computation
-
crisitem.author.orcid
0000-0002-6184-3971
-
crisitem.author.orcid
0000-0003-1255-1953
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E180 - Fakultät für Informatik
-
Appears in Collections:
Article
Thumbnail
Fulltext (Version of Record (published version))
Adobe PDF
(464.18 kB)
Open Access CC BY 4.0
Show simple item record

Page view(s)

238
checked on Nov 23, 2023

Download(s)

63
checked on Nov 23, 2023

Google ScholarTM

Check