Artiom Alhazov

According to our database1, Artiom Alhazov
  • authored at least 103 papers between 2003 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors.
Natural Computing, 2016

Small Universal Deterministic Petri Nets with Inhibitor Arcs.
Journal of Automata, Languages and Combinatorics, 2016

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

Purely Catalytic P Systems over Integers and Their Generative Power.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Simulating R Systems by P Systems.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Particle Complexity of Universal Finite Number-Conserving Cellular Automata.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

2015
Variants of Small Universal P Systems with Catalysts.
Fundam. Inform., 2015

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

Polarizationless P Systems with One Active Membrane.
Proceedings of the Membrane Computing, 2015

2014
Space complexity equivalence of P systems with active membranes and Turing machines.
Theor. Comput. Sci., 2014

Smallest Filters in Complete Obligatory Hybrid Networks of Evolutionary Processors.
Journal of Automata, Languages and Combinatorics, 2014

Antimatter as a Frontier of Tractability in Membrane Computing.
Fundam. Inform., 2014

Length P Systems.
Fundam. Inform., 2014

Solving Problems in Various Domains by Hybrid Models of High Performance Computations.
The Computer Science Journal of Moldova, 2014

Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete.
Proceedings of the Unconventional Computation and Natural Computation, 2014

P System Computational Model as Framework for Hybrid (Membrane-Quantum) Computations.
Proceedings of the Membrane Computing, 2014

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

P Systems with Toxic Objects.
Proceedings of the Membrane Computing, 2014

Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems.
Proceedings of the Membrane Computing, 2014

P Systems with Anti-Matter.
Proceedings of the Membrane Computing, 2014

Matter and Anti-Matter in Membrane Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

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

2013
One-membrane symport with few extra symbols.
Int. J. Comput. Math., 2013

Characterizing the computational power of energy-based P systems.
Int. J. Comput. Math., 2013

Abstracts of Doctor Habilitatus Thesis.
The Computer Science Journal of Moldova, 2013

Developments in Networks of Evolutionary Processors.
The Computer Science Journal of Moldova, 2013

A P System Parsing Word Derivatives.
Proceedings of the Unconventional Computation and Natural Computation, 2013

A P System for Annotation of Romanian Affixes.
Proceedings of the Membrane Computing, 2013

2012
Sequential and maximally parallel multiset rewriting: reversibility and determinism.
Natural Computing, 2012

Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All Universal.
Multiple-Valued Logic and Soft Computing, 2012

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

Turing Computability and Membrane Computing.
Proceedings of the Membrane Computing, 2012

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

Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN.
Proceedings of the Membrane Computing, 2012

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

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

Forward and Backward Chaining with P Systems.
IJNCR, 2011

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

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

Complete Obligatory Hybrid Networks of Evolutionary Processors.
Proceedings of the Highlights in Practical Applications of Agents and Multiagent Systems, 2011

Circular Post Machines and P Systems with Exo-insertion and Deletion.
Proceedings of the Membrane Computing, 2011

Properties of Membrane Systems.
Proceedings of the Membrane Computing, 2011

About Complete Obligatory Hybrid Networks of Evolutionary Processors without Substitution.
Proceedings of the Advances in Computational Intelligence, 2011

2010
Computing the graph-based parallel complexity of gene assembly.
Theor. Comput. Sci., 2010

Membrane Systems Languages Are Polynomial-Time Parsable.
The Computer Science Journal of Moldova, 2010

Investigations on Natural Computing in the Institute of Mathematics and Computer Science.
The Computer Science Journal of Moldova, 2010

Minimal Parallelism and Number of Membrane Polarizations.
The Computer Science Journal of Moldova, 2010

Minimization Strategies for Maximally Parallel Multiset Rewriting Systems
CoRR, 2010

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

On Universality of Radius 1/2 Number-Conserving Cellular Automata.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

Reversibility and Determinism in Sequential Multiset Rewriting.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

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

Polymorphic P Systems.
Proceedings of the Membrane Computing, 2010

The Family of Languages Generated by Non-cooperative Membrane Systems.
Proceedings of the Membrane Computing, 2010

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

2009
The parallel complexity of signed graphs: Decidability results and an improved algorithm.
Theor. Comput. Sci., 2009

On the size of computationally complete hybrid networks of evolutionary processors.
Theor. Comput. Sci., 2009

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

On Networks of Evolutionary Processors with Nodes of Two Types.
Fundam. Inform., 2009

Modelling Inflections in Romanian Language by P Systems with String Replication.
The Computer Science Journal of Moldova, 2009

On Reversibility and Determinism in P Systems.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

Obligatory Hybrid Networks of Evolutionary Processors.
Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

2008
Solutions to computational problems through gene assembly.
Natural Computing, 2008

About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node.
The Computer Science Journal of Moldova, 2008

Summary of researches being performed in the Institute of Mathematics and Computer Science on computer science and information technologies.
The Computer Science Journal of Moldova, 2008

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

Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes.
Proceedings of the Membrane Computing - 9th International Workshop, 2008

About Universal Hybrid Networks of Evolutionary Processors of Small Size.
Proceedings of the Language and Automata Theory and Applications, 2008

Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven Nodes.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

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

Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

Uniform Solution of.
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

Networks of Evolutionary Processors with Two Nodes Are Unpredictable.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Solutions to Computational Problems Through Gene Assembly.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006
P systems without multiplicities of symbol-objects.
Inf. Process. Lett., 2006

Cell/symbol complexity of tissue P systems with symport/antiport rules.
Int. J. Found. Comput. Sci., 2006

Membrane division, restricted membrane creation and object complexity in P systems.
Int. J. Comput. Math., 2006

(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes.
Fundam. Inform., 2006

Generating Languages by P Systems with Minimal Symport/Antiport.
The Computer Science Journal of Moldova, 2006

Solving HPP and SAT by P Systems with Active Membranes and Separation Rules.
Acta Inf., 2006

On the number of nodes in universal networks of evolutionary processors.
Acta Inf., 2006

Static Sorting P Systems.
Proceedings of the Applications of Membrane Computing, 2006

Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Extended Spiking Neural P Systems.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

2005
Further remarks on P systems with active membranes, separation, merging, and release rules.
Soft Comput., 2005

One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

Computational Power of Symport/Antiport: History, Advances, and Open Problems.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Number of Protons/Bi-stable Catalysts and Membranes in P Systems. Time-Freeness.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Minimizing Evolution-Communication P Systems and Automata.
New Generation Comput., 2004

On Determinism of Evolution-Communication P Systems.
J. UCS, 2004

Polarizationless P Systems with Active Membranes.
Grammars, 2004

Trading polarizations for labels in P systems with active membranes.
Acta Inf., 2004

Ultimately Confluent Rewriting Systems. Parallel Multiset-Rewriting with Permitting or Forbidding Contexts.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

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

On the Efficiency of P Systems with Active Membranes and Two Polarizations.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Computational Completeness of P Systems with Active Membranes and Two Polarizations.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Computing by Observing Bio-systems: The Case of Sticker Systems.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Solving Graph Problems by P Systems with Restricted Elementary Active Membranes.
Proceedings of the Aspects of Molecular Computing, 2004

2003
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes.
Fundam. Inform., 2003

Proton Pumping P Systems.
Proceedings of the Membrane Computing, International Workshop, 2003


  Loading...