Yurii Rogozhin

According to our database1, Yurii Rogozhin
  • authored at least 64 papers between 1996 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

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

2014
Generating and accepting P systems with minimal left and right insertion and deletion.
Natural Computing, 2014

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

Small Universal Networks of Evolutionary Processors.
Journal of Automata, Languages and Combinatorics, 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

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

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

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

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

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

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

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

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

Computational power of insertion-deletion (P) systems with rules of size two.
Natural Computing, 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

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

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

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

Graph-Controlled Insertion-Deletion Systems
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 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
On the size of computationally complete hybrid networks of evolutionary processors.
Theor. Comput. Sci., 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

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
About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node.
The Computer Science Journal of Moldova, 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

Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes.
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

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

Insertion-Deletion Systems with One-Sided 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

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

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

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

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

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

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

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

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

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

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

2002
Self-describing Turing machines.
Fundam. Inform., 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

2001
New Small Universal Circular Post Machines.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

A Universal Time-Varying Distributed H System of Degree 1.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

A Universal Turing Machine with 3 States and 9 Symbols.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages.
Proceedings of the Where Mathematics, 2001

Time-Varying Distributed H Systems of Degree 1 Generate All Recursively Enumerable Languages.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
About Time-Varying Distributed H Systems.
Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000

1996
Small Universal Turing Machines.
Theor. Comput. Sci., 1996


  Loading...