Follow
Petr Sosik
Title
Cited by
Cited by
Year
Computationally universal P systems without priorities: two catalysts are sufficient
R Freund, L Kari, M Oswald, P Sosík
Theoretical Computer Science 330 (2), 251-266, 2005
1792005
Normal forms for spiking neural P systems
OH Ibarra, A Păun, G Păun, A Rodríguez-Patón, P Sosík, S Woodworth
Theoretical Computer Science 372 (2-3), 196-217, 2007
1272007
The computational power of cell division in P systems: Beating down parallel computers?
P Sosík
Natural Computing 2, 287-298, 2003
1032003
Membrane computing and complexity theory: A characterization of PSPACE
P Sosík, A Rodríguez-Patón
Journal of Computer and System Sciences 73 (1), 137-152, 2007
962007
P systems attacking hard problems beyond NP: a survey
P Sosík
Journal of Membrane Computing 1 (3), 198-208, 2019
492019
On properties of bond-free DNA languages
L Kari, S Konstantinidis, P Sosík
Theoretical Computer Science 334 (1-3), 131-159, 2005
44*2005
An optimal frontier of the efficiency of tissue P systems with cell separation
MJ Pérez-Jiménez, P Sosík
Fundamenta Informaticae 138 (1-2), 45-60, 2015
422015
Bond-free languages: formalizations, maximality and construction methods
L Kari, S Konstantinidis, P Sosík
International Journal of Foundations of Computer Science 16 (05), 1039-1070, 2005
402005
P colonies: Survey
L Ciencialová, E Csuhaj-Varjú, L Cienciala, P Sosík
Journal of Membrane Computing 1, 178-197, 2019
372019
P systems versus register machines: two universality proofs
P Sosik
Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de …, 2002
372002
Spiking neural P systems: Stronger normal forms
M García Arnau, D Pérez, A Rodríguez Patón, P Sosík
Proceedings of the Fifth Brainstorming Week on Membrane Computing, 157-178 …, 2007
362007
Hairpin structures in DNA words
L Kari, S Konstantinidis, E Losseva, P Sosík, G Thierrin
DNA Computing: 11th International Workshop on DNA Computing, DNA11, London …, 2006
362006
On hairpin-free words and languages
L Kari, S Konstantinidis, P Sosík, G Thierrin
Developments in Language Theory: 9th International Conference, DLT 2005 …, 2005
342005
P systems without priorities are computationally universal
P Sosík, R Freund
Membrane Computing: International Workshop, WMC-CdeA 2002 Curtea de Arges …, 2003
292003
The power of catalysts and priorities in membrane systems
P SosÍk
Grammars 6, 13-24, 2003
282003
DNA Computing-Foundations and Implications.
L Kari, S Seki, P Sosík
Handbook of natural computing 3, 1073-1128, 2012
272012
The undecidability of the infinite ribbon problem: Implications for computing by self-assembly
L Adleman, J Kari, L Kari, D Reishus, P Sosik
SIAM Journal on Computing 38 (6), 2356-2381, 2009
272009
On the weight of universal insertion grammars
L Kari, P Sosík
Theoretical Computer Science 396 (1-3), 264-270, 2008
272008
AP system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem
M García-Arnau, D Manrique, A Rodríguez-Patón, P Sosík
BioSystems 90 (3), 687-697, 2007
232007
A formal language analysis of DNA hairpin structures
L Kari, E Losseva, S Konstantinidis, P Sosík, G Thierrin
Fundamenta Informaticae 71 (4), 453-475, 2006
222006
The system can't perform the operation now. Try again later.
Articles 1–20