2009 |
42 | EE | 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) |
2008 |
41 | EE | 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) |
40 | EE | Lila Kari,
Petr Sosík:
On the weight of universal insertion grammars.
Theor. Comput. Sci. 396(1-3): 264-270 (2008) |
2007 |
39 | EE | 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 |
38 | EE | Peter Sebestyén,
Petr Sosík:
Modelling Multiple Robots in Space: An Adaptive Eco-Grammar System.
Fundam. Inform. 76(3): 367-381 (2007) |
37 | EE | 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) |
36 | EE | 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) |
35 | EE | 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) |
2006 |
34 | EE | Petr Sosík,
Alfonso Rodríguez-Patón:
P Systems with Active Membranes Characterize PSPACE.
DNA 2006: 33-46 |
33 | EE | 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) |
32 | EE | 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) |
2005 |
31 | EE | Lila Kari,
Stavros Konstantinidis,
Elena Losseva,
Petr Sosík,
Gabriel Thierrin:
Hairpin Structures in DNA Words.
DNA 2005: 158-170 |
30 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík,
Gabriel Thierrin:
On Hairpin-Free Words and Languages.
Developments in Language Theory 2005: 296-307 |
29 | EE | Petr Sosík,
Ondrej Valík:
On Evolutionary Lineages of Membrane Systems.
Workshop on Membrane Computing 2005: 67-78 |
28 | EE | 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) |
27 | EE | 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) |
26 | EE | 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) |
25 | EE | Lila Kari,
Petr Sosík:
Aspects of shuffle and deletion on trajectories.
Theor. Comput. Sci. 332(1-3): 47-61 (2005) |
24 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
On properties of bond-free DNA languages.
Theor. Comput. Sci. 334(1-3): 131-159 (2005) |
2004 |
23 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Substitutions, Trajectories and Noisy Channels.
CIAA 2004: 202-212 |
22 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Bond-Free Languages: Formalizations, Maximality and Construction Methods.
DNA 2004: 169-181 |
21 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Preventing Undesirable Bonds Between DNA Codewords.
DNA 2004: 182-191 |
20 | EE | Lila Kari,
Stavros Konstantinidis,
Petr Sosík:
Substitution on Trajectories.
Theory Is Forever 2004: 145-158 |
19 | | Lila Kari,
Petr Sosík:
On Language Equations with Deletion.
Bulletin of the EATCS 83: 173-180 (2004) |
2003 |
18 | EE | Petr Sosík:
The Power of Catalysts and Priorities in Membrane Systems.
Grammars 6(1): 13-24 (2003) |
17 | EE | Petr Sosík:
The computational power of cell division in P systems: Beating down parallel computers?
Natural Computing 2(3): 287-298 (2003) |
16 | EE | Arto Salomaa,
Petr Sosík:
Watson-Crick D0L systems: the power of one transition.
Theor. Comput. Sci. 1-3(301): 187-200 (2003) |
15 | EE | Petr Sosík:
Watson-Crick D0L systems: generative power and undecidable problems.
Theor. Comput. Sci. 306(1-3): 101-112 (2003) |
2002 |
14 | EE | Petr Sosík,
Jirí Matýsek:
Membrane Computing: When Communication Is Enough.
UMC 2002: 264-275 |
13 | EE | Petr Sosík,
Rudolf Freund:
P Systems without Priorities Are Computationally Universal.
WMC-CdeA 2002: 400-409 |
12 | | Petr Sosík:
Universal computation with Watson-Crick D0L systems.
Theor. Comput. Sci. 289(1): 485-501 (2002) |
2001 |
11 | | Jozef Kelemen,
Petr Sosík:
Advances in Artificial Life, 6th European Conference, ECAL 2001, Prague, Czech Republic, September 10-14, 2001, Proceedings
Springer 2001 |
10 | EE | Petr Sosík,
Rudolf Freund:
String Rewriting Sequential P-Systems and Regulated Rewriting.
Developments in Language Theory 2001: 379-388 |
9 | EE | Petr Sosík:
D0L System + Watson-Crick Complementarity = Universal Computation.
MCU 2001: 308-320 |
2000 |
8 | | Petr Sosík:
On the Decidability Problems of Eco-Grammar Systems.
Journal of Automata, Languages and Combinatorics 5(1): 45-58 (2000) |
1999 |
7 | | Petr Sosík:
Parallel Accepting Colonies and Neural Networks.
Grammatical Models of Multi-Agent Systems 1999: 144-156 |
6 | | Petr Sosík:
On the Hierarchy of Extended Conditional Tabled Eco-Grammar Systems.
Grammars 1(3): 225-238 (1999) |
5 | | Petr Sosík:
Conditional Tabled Eco-Grammar Systems: the Scattered Contexts.
Grammars 2(3): 235-245 (1999) |
1998 |
4 | | Petr Sosík:
Eco-Grammar Systems, Decidability and the Tiling Problem.
MFCS Workshop on Grammar Systems 1998: 195-213 |
1997 |
3 | | Petr Sosík,
Leos Stýbnar:
Grammatical Inference of Colonies.
New Trends in Formal Languages 1997: 236-246 |
2 | EE | Petr Sosík:
On Hybrid Connectionist-Symbolic Models.
Acta Cybern. 13(2): 159-172 (1997) |
1996 |
1 | | Petr Sosík:
On Eco-Grammar Systems and Artificial Neural Networks.
Computers and Artificial Intelligence 15(2-3): (1996) |