Articolul precedent |
Articolul urmator |
![]() |
![]() ![]() |
![]() ALHAZOV, Artiom, FREUND, Rudolf, VERLAN, Sergey. Bridging deterministic P systems and conditional grammars. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Ed. 16, 17-21 august 2015, Valencia. Valencia: Springer Verlag, 2015, Vol. 9504 Ed. a 16-a, pp. 63-76. ISBN 978-331928474-3. ISSN 03029743. DOI: https://doi.org/10.1007/978-3-319-28475-0_5 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 9504 Ed. a 16-a, 2015 |
||||||
Conferința "16th International Conference on Membrane Computing" 16, Valencia, Spania, 17-21 august 2015 | ||||||
|
||||||
DOI:https://doi.org/10.1007/978-3-319-28475-0_5 | ||||||
Pag. 63-76 | ||||||
|
||||||
Vezi articolul | ||||||
Rezumat | ||||||
We continue the line of research of deterministic parallel non cooperative multiset rewriting with control. We here generalize control, i.e., rule applicability context conditions, from promoters and inhibitors, which are checking presence or absence of certain objects up to some bound, to regular and even stronger predicates, focusing on predicates over the multiplicity of one symbol at a time. |
||||||
Cuvinte-cheie Artificial Intelligence, computers |
||||||
|