Petr Sosík

Proceedings of the 20th Conference Information Technologies, 2020

2019

P systems attacking hard problems beyond NP: a survey.

[BibT_eX]

[DOI]

J. Membr. Comput., 2019

P colonies.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

J. Membr. Comput., 2019

2018

Generalized P colonies with passive environment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Modeling Plant Development with M Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2018

A Logical Representation of P Colonies: An Introduction.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

Proceedings of the Enjoying Natural Computing, 2018

2017

Directed evolution of biocircuits using conjugative plasmids and CRISPR-Cas9: design and in silico experiments.

[BibT_eX]

[DOI]

David Benes

Nat. Comput., 2017

Morphogenetic and Homeostatic Self-assembled Systems.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2017

On the Robust Power of Morphogenetic Systems for Time Bounded Computation.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2017

2016

Small (purely) catalytic P systems simulating register machines.

[BibT_eX]

[DOI]

Miroslav Langer

Theor. Comput. Sci., 2016

P Colonies with Evolving Environment.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

2015

A limitation of cell division in tissue P systems by PSPACE.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation.

[BibT_eX]

[DOI]

Mario J. Pérez-Jiménez

Fundam. Informaticae, 2015

Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata.

[BibT_eX]

[DOI]

Artiom Alhazov

Comput. Sci. J. Moldova, 2015

An Autonomous In Vivo Dual Selection Protocol for Boolean Genetic Circuits.

[BibT_eX]

[DOI]

David Benes

Artif. Life, 2015

On the Power of Catalytic P Systems with One Catalyst.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2015

2014

PSPACE Limits the Power of P Systems with Active Membranes.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

Computational power of cell separation in tissue P systems.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Three Universal Homogeneous Spiking Neural P Systems Using Max Spike.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

DNA strand displacement system running logic programs.

[BibT_eX]

[DOI]

Iñaki Sainz de Murieta

Biosyst., 2014

Improved universality proof for catalytic P systems and a relation to non-semilinear sets.

[BibT_eX]

Miroslav Langer

Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

2013

P systems with proteins on membranes characterize PSPACE.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Active Membranes, Proteins on Membranes, Tissue P Systems: Complexity-Related Issues and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2013

2012

DNA Computing - Foundations and Implications.

[BibT_eX]

[DOI]

Shinnosuke Seki

Proceedings of the Handbook of Natural Computing, 2012

Tissue P Systems with Cell Separation: Upper Bound by PSPACE.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing, 2012

Limits of the Power of Tissue P Systems with Cell Division.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2012

2011

On the scalability of biocomputing algorithms: The case of the maximum clique problem.

[BibT_eX]

[DOI]

Daniel Manrique

Theor. Comput. Sci., 2011

On the Power of Families of Recognizer Spiking Neural P Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Orthogonal Shuffle on Trajectories.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Autonomous Resolution Based on DNA Strand Displacement.

[BibT_eX]

[DOI]

Iñaki Sainz de Murieta

Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

Selected Topics in Computational Complexity of Membrane Systems.

[BibT_eX]

[DOI]

Proceedings of the Computation, 2011

2010

Catalytic P systems.

[BibT_eX]

[DOI]

Scholarpedia, 2010

Polynomial Complexity Classes in Spiking Neural P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2010

2009

The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Spiking Neural P Systems: Stronger Normal Forms.

[BibT_eX]

[DOI]

David Pérez

Int. J. Unconv. Comput., 2009

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

On the Power of Computing with Proteins on Membranes.

[BibT_eX]

[DOI]

David Pérez

Proceedings of the Membrane Computing, 10th International Workshop, 2009

2008

On the weight of universal insertion grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

On the power of elementary features in spiking neural P systems.

[BibT_eX]

[DOI]

David Pérez

Nat. Comput., 2008

2007

Normal forms for spiking neural P systems.

[BibT_eX]

[DOI]

Oscar H. Ibarra

Gheorghe Paun

Sara Woodworth

Theor. Comput. Sci., 2007

Membrane computing and complexity theory: A characterization of PSPACE.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

On the Power of Deterministic and Sequential Communicating P Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Modelling Multiple Robots in Space: An Adaptive Eco-Grammar System.

[BibT_eX]

[DOI]

Peter Sebestyén

Fundam. Informaticae, 2007

A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem.

[BibT_eX]

[DOI]

Daniel Manrique

Biosyst., 2007

Towards a Robust Biocomputing Solution of Intractable Problems.

[BibT_eX]

[DOI]

Daniel Manrique

Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006

Algebraic properties of substitution on trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

Theor. Comput. Sci., 2006

A Formal Language Analysis of DNA Hairpin Structures.

[BibT_eX]

[DOI]

Elena Losseva

Gabriel Thierrin

Fundam. Informaticae, 2006

P Systems with Active Membranes Characterize PSPACE.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005

Aspects of shuffle and deletion on trajectories.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On properties of bond-free DNA languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Computationally universal P systems without priorities: two catalysts are sufficient.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Bond-free languages: formalizations, maximality and construction methods.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Operations on trajectories with applications to coding and bioinformatics.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

On Evolutionary Lineages of Membrane Systems.

[BibT_eX]

[DOI]

Ondrej Valík

Proceedings of the Membrane Computing, 6th International Workshop, 2005

Hairpin Structures in DNA Words.

[BibT_eX]

[DOI]

Elena Losseva

Gabriel Thierrin

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

On Hairpin-Free Words and Languages.

[BibT_eX]

[DOI]

Gabriel Thierrin

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

On Language Equations with Deletion.

[BibT_eX]

Bull. EATCS, 2004

Substitutions, Trajectories and Noisy Channels.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

Preventing Undesirable Bonds Between DNA Codewords.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Substitution on Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2003

Watson-Crick D0L systems: generative power and undecidable problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Watson-Crick D0L systems: the power of one transition.

[BibT_eX]

[DOI]

Arto Salomaa

Theor. Comput. Sci., 2003

The computational power of cell division in P systems: Beating down parallel computers?

[BibT_eX]

[DOI]

Nat. Comput., 2003

The Power of Catalysts and Priorities in Membrane Systems.

[BibT_eX]

[DOI]

Grammars, 2003

Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities.

[BibT_eX]

Marion Oswald

Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002

Universal computation with Watson-Crick D0L systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

P Systems without Priorities Are Computationally Universal.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, International Workshop, 2002

Membrane Computing: When Communication Is Enough.

[BibT_eX]

[DOI]

Jirí Matýsek

Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

2001

D0L System + Watson-Crick Complementarity = Universal Computation.

[BibT_eX]

[DOI]

Proceedings of the Machines, 2001

String Rewriting Sequential P-Systems and Regulated Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

On the Decidability Problems of Eco-Grammar Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2000

1999

Conditional Tabled Eco-Grammar Systems: the Scattered Contexts.

[BibT_eX]

[DOI]

Grammars, 1999

On the Hierarchy of Extended Conditional Tabled Eco-Grammar Systems.

[BibT_eX]

[DOI]

Grammars, 1999

Parallel Accepting Colonies and Neural Networks.

[BibT_eX]

Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

1998

Eco-Grammar Systems, Decidability and the Tiling Problem.

[BibT_eX]

Proceedings of the Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, 1998

1997

On Hybrid Connectionist-Symbolic Models.

[BibT_eX]

[DOI]

Acta Cybern., 1997

Grammatical Inference of Colonies.

[BibT_eX]

[DOI]

Leos Stýbnar

Proceedings of the New Trends in Formal Languages, 1997

1996

On Eco-Grammar Systems and Artificial Neural Networks.

[BibT_eX]

[DOI]