Остановите войну!
for scientists:
default search action
Sergey Verlan
- > Home > Persons > Sergey Verlan
Publications
- 2023
- [j51]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Numerical networks of cells. Theor. Comput. Sci. 958: 113873 (2023) - 2022
- [j50]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Tissue P Systems with Vesicles of Multisets. Int. J. Found. Comput. Sci. 33(3&4): 179-202 (2022) - [j49]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Regulated Insertion-Deletion Systems. J. Autom. Lang. Comb. 27(1-3): 15-45 (2022) - [c50]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Prescribed Teams of Rules Working on Several Objects. MCU 2022: 27-41 - 2021
- [j45]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete. J. Membr. Comput. 3(4): 233-245 (2021) - 2020
- [j43]Sergey Verlan, Rudolf Freund, Artiom Alhazov, Sergiu Ivanov, Linqiang Pan:
A formal framework for spiking neural P systems. J. Membr. Comput. 2(4): 355-368 (2020) - 2019
- [j40]Rudolf Freund, Vladimir Rogojin, Sergey Verlan:
Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors. Int. J. Found. Comput. Sci. 30(6-7): 1005-1027 (2019) - 2018
- [j38]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Marion Oswald, Sergey Verlan:
Extended spiking neural P systems with white hole rules and their red-green variants. Nat. Comput. 17(2): 297-310 (2018) - [c49]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Marion Oswald, Sergey Verlan:
Chocolate P Automata. Enjoying Natural Computing 2018: 1-20 - [c48]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Tissue P Systems with Point Mutation Rules. Int. Conf. on Membrane Computing 2018: 33-56 - [p3]Artiom Alhazov, Sergey Verlan, Rudolf Freund:
Small Universal Reversible Counter Machines. Reversibility and Universality 2018: 433-446 - 2017
- [c47]Rudolf Freund, Vladimir Rogojin, Sergey Verlan:
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. DCFS 2017: 140-151 - [c43]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
(Tissue) P Systems with Vesicles of Multisets. AFL 2017: 11-25 - 2016
- [c42]Artiom Alhazov, Rudolf Freund, Sergey Verlan:
P Systems Working in Maximal Variants of the Set Derivation Mode. Int. Conf. on Membrane Computing 2016: 83-102 - 2015
- [c38]Artiom Alhazov, Rudolf Freund, Sergey Verlan:
Bridging Deterministic P Systems and Conditional Grammars. Int. Conf. on Membrane Computing 2015: 63-76 - [c37]Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
P Systems with Generalized Multisets Over Totally Ordered Abelian Groups. Int. Conf. on Membrane Computing 2015: 117-136 - 2014
- [j31]Rudolf Freund, Yurii Rogozhin, Sergey Verlan:
Generating and accepting P systems with minimal left and right insertion and deletion. Nat. Comput. 13(2): 257-268 (2014) - [c34]Artiom Alhazov, Rudolf Freund, Sergey Verlan:
Promoters and Inhibitors in Purely Catalytic P Systems. Int. Conf. on Membrane Computing 2014: 126-138 - 2013
- [j30]Rudolf Freund, Ignacio Pérez-Hurtado, Agustin Riscos-Núñez, Sergey Verlan:
A formalization of membrane systems with dynamically evolving structures. Int. J. Comput. Math. 90(4): 801-815 (2013) - [c32]Rudolf Freund, Alberto Leporati, Giancarlo Mauri, Antonio E. Porreca, Sergey Verlan, Claudio Zandron:
Flattening in (Tissue) P Systems. Int. Conf. on Membrane Computing 2013: 173-188 - 2012
- [c30]Artiom Alhazov, Rudolf Freund, Hilbert Heikenwälder, Marion Oswald, Yurii Rogozhin, Sergey Verlan:
Sequential P Systems with Regular Control. Int. Conf. on Membrane Computing 2012: 112-127 - [c28]Rudolf Freund, Yurii Rogozhin, Sergey Verlan:
P Systems with Minimal Left and Right Insertion and Deletion. UCNC 2012: 82-93 - 2011
- [j21]Rudolf Freund, Sergey Verlan:
(Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode. Nat. Comput. 10(2): 821-833 (2011) - 2010
- [c25]Rudolf Freund, Marian Kogler, Yurii Rogozhin, Sergey Verlan:
Graph-Controlled Insertion-Deletion Systems. DCFS 2010: 88-98 - 2009
- [j13]Artiom Alhazov, Marion Oswald, Rudolf Freund, Sergey Verlan:
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions. Fundam. Informaticae 91(1): 17-34 (2009) - [c23]Rudolf Freund, Marian Kogler, Sergey Verlan:
P Automata with Controlled Use of Minimal Communication Rules. NCMA 2009: 107-120 - 2007
- [c17]Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan:
Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. MCU 2007: 110-121 - [c15]Rudolf Freund, Sergey Verlan:
A Formal Framework for Static (Tissue) P Systems. Workshop on Membrane Computing 2007: 271-284 - 2003
- [c3]Franziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
P Systems with Cutting/Recombination Rules Assigned to Membranes. Workshop on Membrane Computing 2003: 191-202
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 2023-10-02 00:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint