Sergey Verlan

Orcid: 0000-0001-7800-1618

Affiliations:
  • University Paris Est Créteil, LACL, France


According to our database1, Sergey Verlan authored at least 107 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Universal enzymatic numerical P systems with small number of enzymatic rules.
Theor. Comput. Sci., 2024

2023
Numerical networks of cells.
Theor. Comput. Sci., May, 2023

A tutorial on the formal framework for spiking neural P systems.
Nat. Comput., March, 2023

2022
Regulated Insertion-Deletion Systems.
J. Autom. Lang. Comb., 2022

Tissue P Systems with Vesicles of Multisets.
Int. J. Found. Comput. Sci., 2022

Prescribed Teams of Rules Working on Several Objects.
Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022

2021
Single semi-contextual insertion-deletion systems.
Nat. Comput., 2021

Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete.
J. Membr. Comput., 2021

FPGA Implementation of Numerical P Systems.
Int. J. Unconv. Comput., 2021

Preface.
Fundam. Informaticae, 2021

An Overview of Hardware Implementation of Membrane Computing Models.
ACM Comput. Surv., 2021

Membrane Computing Models: Implementations
Springer, ISBN: 978-981-16-1565-8, 2021

2020
Universal insertion grammars of size two.
Theor. Comput. Sci., 2020

VYPER: Vulnerability detection in binary code.
Secur. Priv., 2020

A formal framework for spiking neural P systems.
J. Membr. Comput., 2020

2019
UCNC 2018 special issue editorial.
Nat. Comput., 2019

Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors.
Int. J. Found. Comput. Sci., 2019

2018
Extended spiking neural P systems with white hole rules and their red-green variants.
Nat. Comput., 2018

Tissue P Systems with Point Mutation Rules.
Proceedings of the Membrane Computing, 2018

Small Universal Reversible Counter Machines.
Proceedings of the Reversibility and Universality, 2018

Chocolate P Automata.
Proceedings of the Enjoying Natural Computing, 2018

2017
Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems.
Fundam. Informaticae, 2017

Universal Matrix Insertion Grammars with Small Size.
Proceedings of the Unconventional Computation and Natural Computation, 2017

Computationally Complete Generalized Communicating P Systems with Three Cells.
Proceedings of the Membrane Computing, 2017

Bi-simulation Between P Colonies and P Systems with Multi-stable Catalysts.
Proceedings of the Membrane Computing, 2017

Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
Small Universal Deterministic Petri Nets with Inhibitor Arcs.
J. Autom. Lang. Comb., 2016

Fast Hardware Implementations of Static P Systems.
Comput. Informatics, 2016

Insertion-Deletion Systems over Relational Words.
Proceedings of the Reachability Problems - 10th International Workshop, 2016

P Systems Working in Maximal Variants of the Set Derivation Mode.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

2015
Preface.
Fundam. Informaticae, 2015

Random Context and Semi-conditional Insertion-deletion Systems.
Fundam. Informaticae, 2015

P Systems with Generalized Multisets Over Totally Ordered Abelian Groups.
Proceedings of the Membrane Computing, 2015

Bridging Deterministic P Systems and Conditional Grammars.
Proceedings of the Membrane Computing, 2015

Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

Universality in Molecular and Cellular Computing.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Generating and accepting P systems with minimal left and right insertion and deletion.
Nat. Comput., 2014

Small Universal Networks of Evolutionary Processors.
J. Autom. Lang. Comb., 2014

Promoters and Inhibitors in Purely Catalytic P Systems.
Proceedings of the Membrane Computing, 2014

Small Universal Non-deterministic Petri Nets with Inhibitor Arcs.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

Small Universal Devices.
Proceedings of the Computing with New Resources, 2014

2013
A formalization of membrane systems with dynamically evolving structures.
Int. J. Comput. Math., 2013

Small Universal Petri Nets with Inhibitor Arcs.
CoRR, 2013

Using the Formal Framework for P Systems.
Proceedings of the Membrane Computing, 2013

About One-Sided One-Symbol Insertion-Deletion P Systems.
Proceedings of the Membrane Computing, 2013

Flattening in (Tissue) P Systems.
Proceedings of the Membrane Computing, 2013

2012
Matrix insertion-deletion systems.
Theor. Comput. Sci., 2012

On Small Universal Splicing Systems.
Int. J. Found. Comput. Sci., 2012

P systems based on tag operations.
Comput. Sci. J. Moldova, 2012

P Systems with Minimal Left and Right Insertion and Deletion.
Proceedings of the Unconventional Computation and Natural Computation, 2012

Fast Hardware Implementations of P Systems.
Proceedings of the Membrane Computing, 2012

Sequential P Systems with Regular Control.
Proceedings of the Membrane Computing, 2012

2011
On generalized communicating P systems with minimal interaction rules.
Theor. Comput. Sci., 2011

Minimization strategies for maximally parallel multiset rewriting systems.
Theor. Comput. Sci., 2011

P systems with minimal insertion and deletion.
Theor. Comput. Sci., 2011

Computational power of insertion-deletion (P) systems with rules of size two.
Nat. Comput., 2011

(Tissue) P systems working in the <i>k</i>-restricted minimally or maximally parallel transition mode.
Nat. Comput., 2011

Small Universal Tvdh and Test Tube Systems.
Int. J. Found. Comput. Sci., 2011

Universality of Splicing Test Tube Systems with Two Tubes.
Fundam. Informaticae, 2011

P Systems with Insertion and Deletion Exo-Operations.
Fundam. Informaticae, 2011

Generalized Communicating P Systems Working in Fair Sequential Mode.
Sci. Ann. Comput. Sci., 2011

Abstracts of Doctor Habilitatus Thesis.
Comput. Sci. J. Moldova, 2011

Generalized Communicating P Systems Working in Fair Sequential Model
CoRR, 2011

DNA Circuits Based on Isothermal Constrained Loop Extension DNA Amplification
CoRR, 2011

On the Lower Bounds for Asymmetrical Insertion-deletion Languages.
Proceedings of the Biology, Computation and Linguistics - New Interdisciplinary Paradigms, 2011

2010
Recent Developments on Insertion-Deletion Systems.
Comput. Sci. J. Moldova, 2010

Investigations on Natural Computing in the Institute of Mathematics and Computer Science.
Comput. Sci. J. Moldova, 2010

Graph-Controlled Insertion-Deletion Systems
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

A sequence-based analysis of the pointer distribution of stichotrichous ciliates.
Biosyst., 2010

On Generalized Communicating P Systems with One Symbol.
Proceedings of the Membrane Computing, 2010

A Small Universal Splicing P System.
Proceedings of the Membrane Computing, 2010

Small Size Insertion and Deletion Systems.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
Maximal, Locally-Maximal, and Minimal Parallelism in Networks of Cells.
Int. J. Unconv. Comput., 2009

Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions.
Fundam. Informaticae, 2009

P Automata with Controlled Use of Minimal Communication Rules.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

Look-Ahead Evolution for P Systems.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

2008
Generalized communicating P systems.
Theor. Comput. Sci., 2008

On length-separating test tube systems.
Nat. Comput., 2008

How to Synchronize the Activity of All Components of a P System?
Int. J. Found. Comput. Sci., 2008

New Choice for Small Universal Devices: Symport/Antiport P Systems
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Computational Power of P Systems with Small Size Insertion and Deletion Rules
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Fast Synchronization in P Systems.
Proceedings of the Membrane Computing - 9th International Workshop, 2008

Further Results on Insertion-Deletion Systems with One-Sided Contexts.
Proceedings of the Language and Automata Theory and Applications, 2008

2007
On small universal antiport P systems.
Theor. Comput. Sci., 2007

On Minimal Context-Free Insertion-Deletion Systems.
J. Autom. Lang. Comb., 2007

Minimal Cooperation in Symport/antiport Tissue P Systems.
Int. J. Found. Comput. Sci., 2007

A Formal Framework for Static (Tissue) P Systems.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

Insertion-Deletion Systems with One-Sided Contexts.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Producer/Consumer in Membrane Systems and Petri Nets.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Computational Completeness of Tissue P Systems with Conditional Uniport.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

2005
A boundary result on enhanced time-varying distributed H systems with parallel computations.
Theor. Comput. Sci., 2005

Context-free insertion-deletion systems.
Theor. Comput. Sci., 2005

About Splicing P Systems with One Membrane.
Fundam. Informaticae, 2005

Time-Varying Distributed H Systems: An Overview.
Fundam. Informaticae, 2005

On P Systems with Bounded Parallelism.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

On the Rule Complexity of Universal Tissue P Systems.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

2004
Systèmes de Head et applications à la bio-informatique. (Head systems and applications to bio-informatics).
PhD thesis, 2004

Communicative P Systems with Minimal Cooperation.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Tissue P Systems with Minimal Symport/Antiport.
Proceedings of the Developments in Language Theory, 2004

Communicating Distributed H Systems with Alternating Filters.
Proceedings of the Aspects of Molecular Computing, 2004

2003
About Splicing P Systems with Immediate Communication and Non-extended Splicing P Systems.
Proceedings of the Membrane Computing, International Workshop, 2003

P Systems with Cutting/Recombination Rules Assigned to Membranes.
Proceedings of the Membrane Computing, International Workshop, 2003

Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved.
Proceedings of the DNA Computing, 9th International Workshop on DNA Based Computers, 2003

A Frontier Result on Enhanced Time-Varying Distributed H Systems with Parallel Computations.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002
On enhanced time-varying distributed H systems.
Comput. Sci. J. Moldova, 2002

Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations.
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002


  Loading...