default search action
Petr Sosík
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j55]Prithwineel Paul, Petr Sosík:
Solving the SAT problem using spiking neural P systems with coloured spikes and division rules. J. Membr. Comput. 6(3): 222-233 (2024) - [i2]Prithwineel Paul, Petr Sosík, Lucie Ciencialová:
A survey on learning models of spiking neural membrane systems and spiking neural networks. CoRR abs/2403.18609 (2024) - [i1]Tomás Filip, Martin Pavlícek, Petr Sosík:
Fine-tuning multilingual language models in Twitter/X sentiment analysis: a study on Eastern-European V4 languages. CoRR abs/2408.02044 (2024) - 2023
- [j54]Petr Sosík:
Watson-crick (D)0 L systems: a survey. J. Membr. Comput. 5(3): 182-189 (2023) - [j53]Mario J. Pérez-Jiménez, Claudio Zandron, Petr Sosík, David Orellana-Martín:
Preface of the special issue on computational complexity and complex systems. J. Membr. Comput. 5(3): 190-192 (2023) - [j52]Petr Sosík
:
Morphogenetic computing: computability and complexity results. Nat. Comput. 22(1): 161-170 (2023) - 2022
- [j51]Ludek Cienciala, Lucie Ciencialová
P colonies with agent division. Inf. Sci. 589: 162-169 (2022) - [c36]Petr Sosík
Computational Universality and Efficiency in Morphogenetic Systems. MCU 2022: 158-171 - 2021
- [j50]Petr Sosík
Morphogenetic systems for resource bounded computation and modeling. Inf. Sci. 547: 814-827 (2021) - [j49]Petr Sosík, Max H. Garzon, Jan Drastík:
Self-healing turing-universal computation in morphogenetic systems. Nat. Comput. 20(4): 739-750 (2021) - [c35]Martin Pavlícek, Tomás Filip, Petr Sosík:
ZREC architecture for textual sentiment analysis. ITAT 2021: 222-228 - 2020
- [j48]Vladimír Smolka, Jan Drastík, Jaroslav Bradík
Morphogenetic systems: Models and experiments. Biosyst. 198: 104270 (2020) - [j47]Petr Sosík
From P systems to morphogenetic systems: an overview and open problems. J. Membr. Comput. 2(4): 380-391 (2020) - [c34]Martin Pavlícek, Tomás Filip, Petr Sosík:
Zrec.org - Psychosocial Phenomena Studies in Cyberspace. ITAT 2020: 209-216 - [c33]Jiri Blahuta, Tomás Soukup, Petr Sosík:
Approach to Automatic Segmentation of Atherosclerotic Plaque in B-images Using Active Contour Algorithm Adapted by Convolutional Neural Network to Echogenicity Index Computation. ITAT 2020: 223-229 - [e4]Martin Holena, Tomás Horváth, Alica Kelemenová, Frantisek Mráz, Dana Pardubská, Martin Plátek, Petr Sosík:
Proceedings of the 20th Conference Information Technologies - Applications and Theory (ITAT 2020), Hotel Tyrapol, Oravská Lesná, Slovakia, September 18-22, 2020. CEUR Workshop Proceedings 2718, CEUR-WS.org 2020 [contents]
2010 – 2019
- 2019
- [j46]Lucie Ciencialová
P colonies. J. Membr. Comput. 1(3): 178-197 (2019) - [j45]Petr Sosík
P systems attacking hard problems beyond NP: a survey. J. Membr. Comput. 1(3): 198-208 (2019) - 2018
- [j44]Lucie Ciencialová
Generalized P colonies with passive environment. Theor. Comput. Sci. 724: 61-68 (2018) - [c32]Ludek Cienciala, Lucie Ciencialová
A Logical Representation of P Colonies: An Introduction. Enjoying Natural Computing 2018: 66-76 - [c31]Petr Sosík, Vladimír Smolka, Jaroslav Bradík
Modeling Plant Development with M Systems. Int. Conf. on Membrane Computing 2018: 246-257 - 2017
- [j43]David Benes, Alfonso Rodríguez-Patón
Directed evolution of biocircuits using conjugative plasmids and CRISPR-Cas9: design and in silico experiments. Nat. Comput. 16(3): 497-505 (2017) - [c30]Petr Sosík
On the Robust Power of Morphogenetic Systems for Time Bounded Computation. Int. Conf. on Membrane Computing 2017: 270-292 - [c29]Petr Sosík
Morphogenetic and Homeostatic Self-assembled Systems. UCNC 2017: 144-159 - 2016
- [j42]Petr Sosík
Small (purely) catalytic P systems simulating register machines. Theor. Comput. Sci. 623: 65-74 (2016) - [c28]Lucie Ciencialová
P Colonies with Evolving Environment. Int. Conf. on Membrane Computing 2016: 151-164 - 2015
- [j41]David Benes, Petr Sosík
An Autonomous In Vivo Dual Selection Protocol for Boolean Genetic Circuits. Artif. Life 21(2): 247-260 (2015) - [j40]Artiom Alhazov, Rudolf Freund, Petr Sosík:
Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata. Comput. Sci. J. Moldova 23(3): 304-328 (2015) - [j39]Mario J. Pérez-Jiménez
An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation. Fundam. Informaticae 138(1-2): 45-60 (2015) - [j38]Petr Sosík
A limitation of cell division in tissue P systems by PSPACE. J. Comput. Syst. Sci. 81(2): 473-484 (2015) - [c27]Rudolf Freund, Petr Sosík
On the Power of Catalytic P Systems with One Catalyst. Int. Conf. on Membrane Computing 2015: 137-152 - 2014
- [j37]Alfonso Rodríguez-Patón
DNA strand displacement system running logic programs. Biosyst. 115: 5-12 (2014) - [j36]Andrei Paun
Three Universal Homogeneous Spiking Neural P Systems Using Max Spike. Fundam. Informaticae 134(1-2): 167-182 (2014) - [j35]Petr Sosík
Computational power of cell separation in tissue P systems. Inf. Sci. 279: 805-815 (2014) - [j34]Petr Sosík:
PSPACE Limits the Power of P Systems with Active Membranes. J. Autom. Lang. Comb. 19(1-4): 291-304 (2014) - [c26]Petr Sosík, Miroslav Langer:
Improved universality proof for catalytic P systems and a relation to non-semilinear sets. NCMA 2014: 223-233 - [e3]Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, Petr Sosík
Membrane Computing - 15th International Conference, CMC 2014, Prague, Czech Republic, August 20-22, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8961, Springer 2014, ISBN 978-3-319-14369-9 [contents] - 2013
- [j33]Petr Sosík
P systems with proteins on membranes characterize PSPACE. Theor. Comput. Sci. 488: 78-95 (2013) - [c25]Petr Sosík
Active Membranes, Proteins on Membranes, Tissue P Systems: Complexity-Related Issues and Challenges. Int. Conf. on Membrane Computing 2013: 40-55 - 2012
- [c24]Petr Sosík
Limits of the Power of Tissue P Systems with Cell Division. Int. Conf. on Membrane Computing 2012: 390-403 - [c23]Petr Sosík
Tissue P Systems with Cell Separation: Upper Bound by PSPACE. TPNC 2012: 201-215 - [p1]Lila Kari, Shinnosuke Seki, Petr Sosík
DNA Computing - Foundations and Implications. Handbook of Natural Computing 2012: 1073-1127 - 2011
- [j32]Petr Sosík
On the Power of Families of Recognizer Spiking Neural P Systems. Int. J. Found. Comput. Sci. 22(1): 75-88 (2011) - [j31]Mark Daley, Lila Kari, Shinnosuke Seki, Petr Sosík
Orthogonal Shuffle on Trajectories. Int. J. Found. Comput. Sci. 22(1): 213-222 (2011) - [j30]Daniel Manrique
On the scalability of biocomputing algorithms: The case of the maximum clique problem. Theor. Comput. Sci. 412(51): 7075-7086 (2011) - [c22]Petr Sosík
Selected Topics in Computational Complexity of Membrane Systems. Computation, Cooperation, and Life 2011: 125-137 - [c21]Alfonso Rodríguez-Patón
Autonomous Resolution Based on DNA Strand Displacement. DNA 2011: 190-203 - 2010
- [j29]Petr Sosík:
Catalytic P systems. Scholarpedia 5(1): 9336 (2010) - [c20]Petr Sosík
Polynomial Complexity Classes in Spiking Neural P Systems. Int. Conf. on Membrane Computing 2010: 348-360
2000 – 2009
- 2009
- [j28]Petr Sosík
Preface. Int. J. Found. Comput. Sci. 20(3): 379-380 (2009) - [j27]Marc García-Arnau, David Pérez, Alfonso Rodríguez-Patón, Petr Sosík:
Spiking Neural P Systems: Stronger Normal Forms. Int. J. Unconv. Comput. 5(5): 411-425 (2009) - [j26]Leonard M. Adleman, Jarkko Kari
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM J. Comput. 38(6): 2356-2381 (2009) - [c19]Petr Sosík
On the Power of Computing with Proteins on Membranes. Workshop on Membrane Computing 2009: 448-460 - [e2]Ashish Goel, Friedrich C. Simmel, Petr Sosík:
DNA Computing, 14th International Meeting on DNA Computing, DNA 14, Prague, Czech Republic, June 2-9, 2008. Revised Selected Papers. Lecture Notes in Computer Science 5347, Springer 2009, ISBN 978-3-642-03075-8 [contents] - 2008
- [j25]Marc García-Arnau, David Pérez, Alfonso Rodríguez-Patón
On the power of elementary features in spiking neural P systems. Nat. Comput. 7(4): 471-483 (2008) - [j24]Lila Kari, Petr Sosík
On the weight of universal insertion grammars. Theor. Comput. Sci. 396(1-3): 264-270 (2008) - 2007
- [j23]Marc García-Arnau, Daniel Manrique
A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem. Biosyst. 90(3): 687-697 (2007) - [j22]Peter Sebestyén, Petr Sosík:
Modelling Multiple Robots in Space: An Adaptive Eco-Grammar System. Fundam. Informaticae 76(3): 367-381 (2007) - [j21]Ludek Cienciala, Lucie Ciencialová
On the Power of Deterministic and Sequential Communicating P Systems. Int. J. Found. Comput. Sci. 18(2): 415-431 (2007) - [j20]Petr Sosík
Membrane computing and complexity theory: A characterization of PSPACE. J. Comput. Syst. Sci. 73(1): 137-152 (2007) - [j19]Oscar H. Ibarra, Andrei Paun
Normal forms for spiking neural P systems. Theor. Comput. Sci. 372(2-3): 196-217 (2007) - [c18]Marc García-Arnau, Daniel Manrique
Towards a Robust Biocomputing Solution of Intractable Problems. DNA 2007: 221-230 - 2006
- [j18]Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
A Formal Language Analysis of DNA Hairpin Structures. Fundam. Informaticae 71(4): 453-475 (2006) - [j17]Michael Domaratzki
Algebraic properties of substitution on trajectories. Theor. Comput. Sci. 369(1-3): 183-196 (2006) - [c17]Petr Sosík
P Systems with Active Membranes Characterize PSPACE. DNA 2006: 33-46 - 2005
- [j16]Lila Kari, Stavros Konstantinidis
Operations on trajectories with applications to coding and bioinformatics. Int. J. Found. Comput. Sci. 16(3): 531-546 (2005) - [j15]Lila Kari, Stavros Konstantinidis
Bond-free languages: formalizations, maximality and construction methods. Int. J. Found. Comput. Sci. 16(5): 1039-1070 (2005) - [j14]Rudolf Freund, Lila Kari, Marion Oswald, Petr Sosík
Computationally universal P systems without priorities: two catalysts are sufficient. Theor. Comput. Sci. 330(2): 251-266 (2005) - [j13]Lila Kari, Petr Sosík
Aspects of shuffle and deletion on trajectories. Theor. Comput. Sci. 332(1-3): 47-61 (2005) - [j12]Lila Kari, Stavros Konstantinidis
On properties of bond-free DNA languages. Theor. Comput. Sci. 334(1-3): 131-159 (2005) - [c16]Lila Kari, Petr Sosík:
On Weight of Universal Insertion Grammars. DCFS 2005: 206-214 - [c15]Lila Kari, Stavros Konstantinidis
On Hairpin-Free Words and Languages. Developments in Language Theory 2005: 296-307 - [c14]Lila Kari, Stavros Konstantinidis
Hairpin Structures in DNA Words. DNA 2005: 158-170 - [c13]Petr Sosík
On Evolutionary Lineages of Membrane Systems. Workshop on Membrane Computing 2005: 67-78 - 2004
- [j11]Lila Kari, Petr Sosík:
On Language Equations with Deletion. Bull. EATCS 83: 173-180 (2004) - [c12]Lila Kari, Stavros Konstantinidis
Substitution on Trajectories. Theory Is Forever 2004: 145-158 - [c11]Lila Kari, Stavros Konstantinidis
Bond-Free Languages: Formalizations, Maximality and Construction Methods. DNA 2004: 169-181 - [c10]Lila Kari, Stavros Konstantinidis
Preventing Undesirable Bonds Between DNA Codewords. DNA 2004: 182-191 - [c9]Lila Kari, Stavros Konstantinidis
Substitutions, Trajectories and Noisy Channels. CIAA 2004: 202-212 - 2003
- [j10]Petr Sosík
The Power of Catalysts and Priorities in Membrane Systems. Grammars 6(1): 13-24 (2003) - [j9]Petr Sosík
The computational power of cell division in P systems: Beating down parallel computers? Nat. Comput. 2(3): 287-298 (2003) - [j8]Arto Salomaa, Petr Sosík
Watson-Crick D0L systems: the power of one transition. Theor. Comput. Sci. 301(1-3): 187-200 (2003) - [j7]Petr Sosík
Watson-Crick D0L systems: generative power and undecidable problems. Theor. Comput. Sci. 306(1-3): 101-112 (2003) - [c8]Rudolf Freund, Marion Oswald, Petr Sosík:
Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities. DCFS 2003: 102-113 - 2002
- [j6]Petr Sosík
Universal computation with Watson-Crick D0L systems. Theor. Comput. Sci. 289(1): 485-501 (2002) - [c7]Petr Sosík
Membrane Computing: When Communication Is Enough. UMC 2002: 264-275 - [c6]Petr Sosík
P Systems without Priorities Are Computationally Universal. WMC-CdeA 2002: 400-409 - 2001
- [c5]Petr Sosík
String Rewriting Sequential P-Systems and Regulated Rewriting. Developments in Language Theory 2001: 379-388 - [c4]Petr Sosík
D0L System + Watson-Crick Complementarity = Universal Computation. MCU 2001: 308-320 - [e1]Jozef Kelemen, Petr Sosík:
Advances in Artificial Life, 6th European Conference, ECAL 2001, Prague, Czech Republic, September 10-14, 2001, Proceedings. Lecture Notes in Computer Science 2159, Springer 2001, ISBN 3-540-42567-5 [contents] - 2000
- [j5]Petr Sosík:
On the Decidability Problems of Eco-Grammar Systems. J. Autom. Lang. Comb. 5(1): 45-58 (2000)
1990 – 1999
- 1999
- [j4]Petr Sosík:
On the Hierarchy of Extended Conditional Tabled Eco-Grammar Systems. Grammars 1(3): 225-238 (1999) - [j3]Petr Sosík:
Conditional Tabled Eco-Grammar Systems: the Scattered Contexts. Grammars 2(3): 235-245 (1999) - [c3]Petr Sosík:
Parallel Accepting Colonies and Neural Networks. Grammatical Models of Multi-Agent Systems 1999: 144-156 - 1998
- [c2]Petr Sosík:
Eco-Grammar Systems, Decidability and the Tiling Problem. MFCS Workshop on Grammar Systems 1998: 195-213 - 1997
- [j2]Petr Sosík:
On Hybrid Connectionist-Symbolic Models. Acta Cybern. 13(2): 159-172 (1997) - [c1]Petr Sosík, Leos Stýbnar:
Grammatical Inference of Colonies. New Trends in Formal Languages 1997: 236-246 - 1996
- [j1]Petr Sosík:
On Eco-Grammar Systems and Artificial Neural Networks. Comput. Artif. Intell. 15(2-3): 247-264 (1996)
Coauthor Index
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-10-30 20:34 CET 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: