Petr Sosík

Petr Sosík: Limits of the Power of Tissue P Systems with Cell Division. Int. Conf. on Membrane Computing 2012: 390-403

Petr Sosík, Ludek Cienciala: Tissue P Systems with Cell Separation: Upper Bound by PSPACE. TPNC 2012: 201-215

Petr Sosík, Alfonso Rodríguez-Patón, Ludek Cienciala: On the Power of Families of Recognizer Spiking Neural P Systems. Int. J. Found. Comput. Sci. 22(1): 75-88 (2011)

Mark Daley, Lila Kari, Shinnosuke Seki, Petr Sosík: Orthogonal Shuffle on Trajectories. Int. J. Found. Comput. Sci. 22(1): 213-222 (2011)

Daniel Manrique, Alfonso Rodríguez-Patón, Petr Sosík: On the scalability of biocomputing algorithms: The case of the maximum clique problem. Theor. Comput. Sci. 412(51): 7075-7086 (2011)

Petr Sosík: Selected Topics in Computational Complexity of Membrane Systems. Computation, Cooperation, and Life 2011: 125-137

Alfonso Rodríguez-Patón, Iñaki Sainz de Murieta, Petr Sosík: Autonomous Resolution Based on DNA Strand Displacement. DNA 2011: 190-203

Petr Sosík: Catalytic P systems. Scholarpedia 5(1): 9336 (2010)

Petr Sosík, Alfonso Rodríguez-Patón, Lucie Ciencialová: Polynomial Complexity Classes in Spiking Neural P Systems. Int. Conf. on Membrane Computing 2010: 348-360

Petr Sosík: Preface. Int. J. Found. Comput. Sci. 20(3): 379-380 (2009)

Marc García-Arnau, David Pérez, Alfonso Rodríguez-Patón, Petr Sosík: Spiking Neural P Systems: Stronger Normal Forms. IJUC 5(5): 411-425 (2009)

Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus, Petr Sosík: The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM J. Comput. 38(6): 2356-2381 (2009)

Petr Sosík, Andrei Paun, Alfonso Rodríguez-Patón, David Pérez: On the Power of Computing with Proteins on Membranes. Workshop on Membrane Computing 2009: 448-460

Ashish Goel, Friedrich C. Simmel, Petr Sosík (Eds.): 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

Marc García-Arnau, David Pérez, Alfonso Rodríguez-Patón, Petr Sosík: On the power of elementary features in spiking neural P systems. Natural Computing 7(4): 471-483 (2008)

Lila Kari, Petr Sosík: On the weight of universal insertion grammars. Theor. Comput. Sci. 396(1-3): 264-270 (2008)

Marc García-Arnau, Daniel Manrique, Alfonso Rodríguez-Patón, Petr Sosík: A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem. Biosystems 90(3): 687-697 (2007)

Peter Sebestyén, Petr Sosík: Modelling Multiple Robots in Space: An Adaptive Eco-Grammar System. Fundam. Inform. 76(3): 367-381 (2007)

Ludek Cienciala, Lucie Ciencialová, Pierluigi Frisco, Petr Sosík: On the Power of Deterministic and Sequential Communicating P Systems. Int. J. Found. Comput. Sci. 18(2): 415-431 (2007)

Petr Sosík, Alfonso Rodríguez-Patón: Membrane computing and complexity theory: A characterization of PSPACE. J. Comput. Syst. Sci. 73(1): 137-152 (2007)

Oscar H. Ibarra, Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón, Petr Sosík, Sara Woodworth: Normal forms for spiking neural P systems. Theor. Comput. Sci. 372(2-3): 196-217 (2007)

Marc García-Arnau, Daniel Manrique, Alfonso Rodríguez-Patón, Petr Sosík: Towards a Robust Biocomputing Solution of Intractable Problems. DNA 2007: 221-230

Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin: A Formal Language Analysis of DNA Hairpin Structures. Fundam. Inform. 71(4): 453-475 (2006)

Michael Domaratzki, Petr Sosík, Alfonso Rodríguez-Patón: Algebraic properties of substitution on trajectories. Theor. Comput. Sci. 369(1-3): 183-196 (2006)

Petr Sosík, Alfonso Rodríguez-Patón: P Systems with Active Membranes Characterize PSPACE. DNA 2006: 33-46

Lila Kari, Stavros Konstantinidis, Petr Sosík: Operations on trajectories with applications to coding and bioinformatics. Int. J. Found. Comput. Sci. 16(3): 531-546 (2005)

Lila Kari, Stavros Konstantinidis, Petr Sosík: Bond-free languages: formalizations, maximality and construction methods. Int. J. Found. Comput. Sci. 16(5): 1039-1070 (2005)

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)

Lila Kari, Petr Sosík: Aspects of shuffle and deletion on trajectories. Theor. Comput. Sci. 332(1-3): 47-61 (2005)

Lila Kari, Stavros Konstantinidis, Petr Sosík: On properties of bond-free DNA languages. Theor. Comput. Sci. 334(1-3): 131-159 (2005)

Lila Kari, Petr Sosík: On Weight of Universal Insertion Grammars. DCFS 2005: 206-214

Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin: On Hairpin-Free Words and Languages. Developments in Language Theory 2005: 296-307

Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin: Hairpin Structures in DNA Words. DNA 2005: 158-170

Petr Sosík, Ondrej Valík: On Evolutionary Lineages of Membrane Systems. Workshop on Membrane Computing 2005: 67-78

Lila Kari, Petr Sosík: On Language Equations with Deletion. Bulletin of the EATCS 83: 173-180 (2004)

Lila Kari, Stavros Konstantinidis, Petr Sosík: Substitution on Trajectories. Theory Is Forever 2004: 145-158

Lila Kari, Stavros Konstantinidis, Petr Sosík: Bond-Free Languages: Formalizations, Maximality and Construction Methods. DNA 2004: 169-181

Lila Kari, Stavros Konstantinidis, Petr Sosík: Preventing Undesirable Bonds Between DNA Codewords. DNA 2004: 182-191

Lila Kari, Stavros Konstantinidis, Petr Sosík: Substitutions, Trajectories and Noisy Channels. CIAA 2004: 202-212

Petr Sosík: The Power of Catalysts and Priorities in Membrane Systems. Grammars 6(1): 13-24 (2003)

Petr Sosík: The computational power of cell division in P systems: Beating down parallel computers? Natural Computing 2(3): 287-298 (2003)

Arto Salomaa, Petr Sosík: Watson-Crick D0L systems: the power of one transition. Theor. Comput. Sci. 1-3(301): 187-200 (2003)

Petr Sosík: Watson-Crick D0L systems: generative power and undecidable problems. Theor. Comput. Sci. 306(1-3): 101-112 (2003)

Rudolf Freund, Marion Oswald, Petr Sosík: Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities. DCFS 2003: 102-113

Petr Sosík: Universal computation with Watson-Crick D0L systems. Theor. Comput. Sci. 289(1): 485-501 (2002)

Petr Sosík, Jirí Matýsek: Membrane Computing: When Communication Is Enough. UMC 2002: 264-275

Petr Sosík, Rudolf Freund: P Systems without Priorities Are Computationally Universal. WMC-CdeA 2002: 400-409

Petr Sosík, Rudolf Freund: String Rewriting Sequential P-Systems and Regulated Rewriting. Developments in Language Theory 2001: 379-388

Petr Sosík: D0L System + Watson-Crick Complementarity = Universal Computation. MCU 2001: 308-320

Jozef Kelemen, Petr Sosík (Eds.): 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

Petr Sosík: On the Decidability Problems of Eco-Grammar Systems. Journal of Automata, Languages and Combinatorics 5(1): 45-58 (2000)

Petr Sosík: On the Hierarchy of Extended Conditional Tabled Eco-Grammar Systems. Grammars 1(3): 225-238 (1999)

Petr Sosík: Conditional Tabled Eco-Grammar Systems: the Scattered Contexts. Grammars 2(3): 235-245 (1999)

Petr Sosík: Parallel Accepting Colonies and Neural Networks. Grammatical Models of Multi-Agent Systems 1999: 144-156

Petr Sosík: Eco-Grammar Systems, Decidability and the Tiling Problem. MFCS Workshop on Grammar Systems 1998: 195-213

Petr Sosík: On Hybrid Connectionist-Symbolic Models. Acta Cybern. 13(2): 159-172 (1997)

Petr Sosík, Leos Stýbnar: Grammatical Inference of Colonies. New Trends in Formal Languages 1997: 236-246

Petr Sosík: On Eco-Grammar Systems and Artificial Neural Networks. Computers and Artificial Intelligence 15(2-3) (1996)