Victor Mitrana

According to our database1, Victor Mitrana authored at least 181 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Networks of evolutionary processors: wheel graph simulation.
J. Membr. Comput., December, 2023

Networks of splicing processors: simulations between topologies.
J. Membr. Comput., June, 2023

On the Degree of Extension of Some Models Defining Non-Regular Languages.
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

2022
Simulating polarization by random context filters in networks of evolutionary processors.
J. Appl. Math. Comput., February, 2022

Accepting multiple splicing systems.
J. King Saud Univ. Comput. Inf. Sci., 2022

2021
Filters defined by random contexts versus polarization in networks of evolutionary processors.
Theor. Comput. Sci., 2021

Hairpin completions and reductions: semilinearity properties.
Nat. Comput., 2021

Non-preserving Accepting Splicing Systems.
J. Autom. Lang. Comb., 2021

Simulations between Network Topologies in Networks of Evolutionary Processors.
Axioms, 2021

2020
On the group memory complexity of extended finite automata over groups.
J. Log. Algebraic Methods Program., 2020

On the degrees of non-regularity and non-context-freeness.
J. Comput. Syst. Sci., 2020

2019
Polarization: a new communication protocol in networks of bio-inspired processors.
J. Membr. Comput., 2019

{Networks of Uniform Splicing Processors.
CoRR, 2019

Further Properties of Self-assembly by Hairpin Formation.
Proceedings of the Unconventional Computation and Natural Computation, 2019

DNA self-assembly by hairpin (extended abstract).
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

A Multi-agent Model for Cell Population.
Proceedings of the Agents and Multi-agent Systems: Technologies and Applications 2019, 2019

High Performance and Scalable Simulations of a Bio-inspired Computational Model.
Proceedings of the 17th International Conference on High Performance Computing & Simulation, 2019

Ultra-Scalable Simulations of Networks of Polarized Evolutionary Processors.
Proceedings of the 3rd International Conference on Advances in Artificial Intelligence, 2019

How Complex is to Solve a Hard Problem with Accepting Splicing Systems.
Proceedings of the 4th International Conference on Complexity, 2019

2018
Small networks of polarized splicing processors are universal.
Nat. Comput., 2018

DNA-Guided Assembly of Nanocellulose Meshes.
Proceedings of the Theory and Practice of Natural Computing - 7th International Conference, 2018

Towards Probabilistic Networks of Polarized Evolutionary Processors.
Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018

2017
Prefix-suffix square reduction.
Theor. Comput. Sci., 2017

Transducers based on networks of polarized evolutionary processors.
Theor. Comput. Sci., 2017

Networks of picture processors as problem solvers.
Soft Comput., 2017

Networks of polarized multiset processors.
J. Comput. Syst. Sci., 2017

On the computational power of networks of polarized evolutionary processors.
Inf. Comput., 2017

Networks of Polarized Splicing Processors.
Proceedings of the Theory and Practice of Natural Computing - 6th International Conference, 2017

2016
Networks of splicing processors with evaluation sets as optimization problems solvers.
Inf. Sci., 2016

Networks of picture processors.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015
Hairpin lengthening: language theoretic and algorithmic results.
J. Log. Comput., 2015

Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results.
Int. J. Found. Comput. Sci., 2015

Ambiguity of the Multiple Interpretations on Regular Languages.
Fundam. Informaticae, 2015

2014
Prefix-suffix duplication.
J. Comput. Syst. Sci., 2014

Transducers Based on Networks of Evolutionary Processors.
J. Autom. Lang. Comb., 2014

Networks of polarized evolutionary processors.
Inf. Sci., 2014

Accepting Networks of Evolutionary Picture Processors.
Fundam. Informaticae, 2014

Bounded Prefix-Suffix Duplication.
Proceedings of the Implementation and Application of Automata, 2014

Solving 2D-Pattern Matching with Networks of Picture Processors.
Proceedings of the Theory and Practice of Natural Computing, 2014

Networks of Polarized Evolutionary Processors Are Computationally Complete.
Proceedings of the Language and Automata Theory and Applications, 2014

Two Variants of Synchronized Shuffle on Backbones.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Accepting splicing systems with permitting and forbidding words.
Acta Informatica, 2013

2012
Deciding regularity of hairpin completions of regular languages in polynomial time.
Inf. Comput., 2012

Networks of Polarized Evolutionary Processors as Problem Solvers.
Proceedings of the Advances in Knowledge-Based and Intelligent Information and Engineering Systems, 2012

Uniform Distributed Pushdown Automata Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

Hairpin Lengthening and Shortening of Regular Languages.
Proceedings of the Languages Alive, 2012

2011
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors.
Nat. Comput., 2011

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

Filter Position in Networks of Substitution Processors Does not Matter.
Int. J. Found. Comput. Sci., 2011

Bounded hairpin completion.
Inf. Comput., 2011

The role of evolutionary operations in accepting hybrid networks of evolutionary processors.
Inf. Comput., 2011

New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries.
Acta Informatica, 2011

Simulating Accepting Networks of Evolutionary Processors with Filtered Connections by Accepting Evolutionary P Systems - (Extended Abstract).
Proceedings of the Foundations on Natural and Artificial Computation, 2011

On the Degree of Team Cooperation in CD Grammar Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

Splicing Systems: Accepting Versus Generating.
Proceedings of the Models of Computation in Context, 2011

Context Insertions.
Proceedings of the Computation, 2011

2010
Accepting splicing systems.
Theor. Comput. Sci., 2010

A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors.
Theory Comput. Syst., 2010

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections.
J. Autom. Lang. Comb., 2010

Some Remarks on the Hairpin Completion.
Int. J. Found. Comput. Sci., 2010

Small universal accepting hybrid networks of evolutionary processors.
Acta Informatica, 2010

Hairpin Lengthening.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Accepting Networks of Evolutionary Word and Picture Processors: A Survey.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
Accepting Networks of Non-inserting Evolutionary Processors.
Trans. Comp. Sys. Biology, 2009

Two complementary operations inspired by the DNA hairpin formation: Completion and reduction.
Theor. Comput. Sci., 2009

On small, reduced, and fast universal accepting networks of splicing processors.
Theor. Comput. Sci., 2009

Networks of Evolutionary Picture Processors with Filtered Connections.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes.
Proceedings of the Language and Automata Theory and Applications, 2009

Bounded Hairpin Completion.
Proceedings of the Language and Automata Theory and Applications, 2009

On the Hairpin Completion of Regular Languages.
Proceedings of the Theoretical Aspects of Computing, 2009

Accepting Networks of Evolutionary Processors: Complexity Aspects - Recent Results and New Challenges.
Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof.
Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

Some Remarks on Superposition Based on Watson-Crick-Like Complementarity.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2007
Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82].
Theor. Comput. Sci., 2007

Accepting networks of splicing processors: Complexity results.
Theor. Comput. Sci., 2007

On the size complexity of universal accepting hybrid networks of evolutionary processors.
Math. Struct. Comput. Sci., 2007

Accepting Networks of Evolutionary Processors with Filtered Connections.
J. Univers. Comput. Sci., 2007

Uniformly bounded duplication codes.
RAIRO Theor. Informatics Appl., 2007

Returning and non-returning parallel communicating finite automata are equivalent.
RAIRO Theor. Informatics Appl., 2007

Remarks on arbitrary multiple pattern interpretations.
Inf. Process. Lett., 2007

All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size.
Inf. Process. Lett., 2007

Decision Problems on Path-Controlled Grammars.
Int. J. Found. Comput. Sci., 2007

Non-preserving splicing with delay.
Int. J. Comput. Math., 2007

A Possible Connection Between Two Theories: Grammar Systems and Concurrent Programming.
Fundam. Informaticae, 2007

Accepting Networks of Splicing Processors with Filtered Connections.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Hairpin Completion Versus Hairpin Reduction.
Proceedings of the Computation and Logic in the Real World, 2007

Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors.
Proceedings of the Formal Models, 2007

2006
Superposition Based on Watson-Crick-Like Complementarity.
Theory Comput. Syst., 2006

Synchronized Shuffle on Backbones.
Fundam. Informaticae, 2006

On Some Algorithmic Problems Regarding the Hairpin Completion.
Electron. Notes Discret. Math., 2006

Solving SAT and HPP with Accepting Splicing Systems.
Proceedings of the Parallel Problem Solving from Nature, 2006

All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005
On the size complexity of hybrid networks of evolutionary processors.
Theor. Comput. Sci., 2005

Synchronized shuffles.
Theor. Comput. Sci., 2005

Marcus External Contextual Grammars: From One to Many Dimensions.
Fundam. Informaticae, 2005

A Universal Accepting Hybrid Network of Evolutionary Processors.
Proceedings of the First International Workshop on Developments in Computational Models, 2005

Uniformly bounded duplication languages.
Discret. Appl. Math., 2005

Hybrid networks of evolutionary processors are computationally complete.
Acta Informatica, 2005

Contextual Information Systems.
Proceedings of the Modeling and Using Context, 2005

Accepting Networks of Splicing Processors.
Proceedings of the New Computational Paradigms, 2005

2004
On differentiation functions, structure functions, and related languages of context-free grammars.
RAIRO Theor. Informatics Appl., 2004

Teams of pushdown automata.
Int. J. Comput. Math., 2004

A New Uniform Translocation Distance.
Proceedings of the Structural, 2004

Solving 3CNF-SAT and HPP in Linear Time Using WWW.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Accepting Hybrid Networks of Evolutionary Processors.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Formal Languages Arising from Gene Repeated Duplication.
Proceedings of the Aspects of Molecular Computing, 2004

Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages.
Proceedings of the Theory Is Forever, 2004

2003
Weighted Grammars and Automata with Threshold Interpretation.
J. Autom. Lang. Comb., 2003

On the sentence valuation in a semiring.
Inf. Sci., 2003

Networks of evolutionary processors.
Acta Informatica, 2003

An Agent Based Approach of Collective Foraging.
Proceedings of the Artificial Neural Nets Problem Solving Methods, 2003

Hybrid Networks of Evolutionary Processors.
Proceedings of the Genetic and Evolutionary Computation, 2003

Distributed Pushdown Automata Systems: Computational Power.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Some Complexity Aspects of Hybrid Networks of Evolutionary Processors.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

Crossing-Over on Languages: A Formal Representation of Chromosomes Recombination.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

Grammars and automata for string processors - from mathematics and computer science to biology, and back: essays in honour of Gheorghe Paun.
Topics in computer mathematics 9, Taylor & Francis, ISBN: 978-0-415-29885-8, 2003

2002
Operations and language generating devices suggested by the genome evolution.
Theor. Comput. Sci., 2002

On Some Operations on Strings Suggested by Gene Assembly in Ciliates.
New Gener. Comput., 2002

Grammars with Bounded-Life Resources.
J. Autom. Lang. Comb., 2002

Parallel Finite Automata Systems Communicating by States.
Int. J. Found. Comput. Sci., 2002

Multiple Pattern Interpretations.
Grammars, 2002

Closure Properties of Multiset Language Families.
Fundam. Informaticae, 2002

Considerations on a Multiset Model for Membrane Computing.
Proceedings of the Membrane Computing, International Workshop, 2002

Parallel Communicating Finite Transducer Systems.
Proceedings of the Computational Linguistics in the Netherlands 2002, 2002

2001
Formal properties of PA-matching.
Theor. Comput. Sci., 2001

Some undecidable problems for parallel communicating finite automata systems.
Inf. Process. Lett., 2001

Towards Biolinguistics.
Grammars, 2001

Chomsky-Schu"tzenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages.
Proceedings of the joint meeting of the 6th Conference on Formal Grammar (FG) and the 7th Conference on Mathematics of Language (MOL), 2001

Extended finite automata over groups.
Discret. Appl. Math., 2001

On the Power of P Systems with Valuations.
Computación y Sistemas, 2001

Group weighted finite transducers.
Acta Informatica, 2001

Solving NP-Complete Problems With Networks of Evolutionary Processors.
Proceedings of the Connectionist Models of Neurons, 2001

Neo-modularity and colonies.
Proceedings of the Where Mathematics, 2001

Some Remarks on Hairpin and Loop Languages.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
Colonies with limited activation of components.
Theor. Comput. Sci., 2000

Uniquely Parsable Accepting Grammar Systems.
J. Univers. Comput. Sci., 2000

On the Degree of Communication in Parallel Communicating Finite Automata Systems.
J. Autom. Lang. Comb., 2000

Parallel Communicating Pushdown Automata Systems.
Int. J. Found. Comput. Sci., 2000

Finite Automata over Free Groups.
Int. J. Algebra Comput., 2000

Dynamical Teams in Eco-Grammar Systems.
Fundam. Informaticae, 2000

Evolutionary Systems: A Language Generating Device Inspired by Evolving Communities of Cells.
Acta Informatica, 2000

Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages.
Proceedings of the Multiset Processing, 2000

Multiset Automata.
Proceedings of the Multiset Processing, 2000

P Systems with Valuations.
Proceedings of the Unconventional Models of Computation, 2000

On the Sentence Valuations in a Semiring.
Proceedings of the International Colloquium on Words, 2000

A New-Old Class of Linguistically Motivated Regulated Grammars.
Proceedings of the Computational Linguistics in the Netherlands 2000, 2000

On Context-Free Duplications.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
Stack Cooperation in Multistack Pushdown Automata.
J. Comput. Syst. Sci., 1999

Patterns and Languages: An Overview.
Grammars, 1999

On the Regularity of Duplication Closure.
Bull. EATCS, 1999

Some Properties of Duplication Grammars.
Acta Cybern., 1999

On the Degree of Cooperation in CD Grammar Systems.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

About Symbolic Encryption: Separable Encryption Systems.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

1998
Chomsky-Schutzenberger Type Characterizations Based on Contextual Languages.
Grammars, 1998

Parallelism in Contextual Grammars.
Fundam. Informaticae, 1998

Cooperation in Contextual Grammars.
Proceedings of the Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, 1998

1997
Cooperation in Context-Free Grammars.
Theor. Comput. Sci., 1997

Crossover Systems. A Generalization of Splicing Systems.
J. Autom. Lang. Comb., 1997

Primitive Morphisms.
Inf. Process. Lett., 1997

Some Remarks on Morphisms and Primitivity.
Bull. EATCS, 1997

On the Interdependence Between Shuffle and Crossing-Over Operations.
Acta Informatica, 1997

Point mutations in context-free languages.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

The Accepting Power of Finite Automata over Groups.
Proceedings of the New Trends in Formal Languages, 1997

Deterministic Cooperating Distributed Grammar Systems.
Proceedings of the New Trends in Formal Languages, 1997

1996
Pattern Systems.
Theor. Comput. Sci., 1996

Iterated Pattern Languages.
J. Autom. Lang. Comb., 1996

Binary self-adding sequences and languages.
Int. J. Comput. Math., 1996

Distributed Catenation Versus Shuffle.
Bull. EATCS, 1996

Splicing Grammar Systems.
Comput. Artif. Intell., 1996

Fairness in Grammar Systems.
Acta Cybern., 1996

Crossing-over on Languages. A Formal Representation of the Chromosome Recombination.
Proceedings of the German Conference on Bioinformatics, 1996

Evolutionary Grammars: A Granunatical Model for Genome Evolution.
Proceedings of the German Conference on Bioinformatics, 1996

Evolutionary Grammars: A Grammatical Model for Genome Evolution.
Proceedings of the Bioinformatics, German Conference on Bioinformatics, Leipzig, 1996

1995
Similarity in Grammar Systems.
Fundam. Informaticae, 1995

Binary Self-Adding Sequences.
Proceedings of the Developments in Language Theory II, 1995

1994
Structuring Grammar Systems by Priorities and Hierarchies.
Acta Cybern., 1994

Contextual Grammars: The Strategy of Minimal Competence.
Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993
On Languages Satisfying "Interchange Lemma".
RAIRO Theor. Informatics Appl., 1993

Parallel Substitution on Words and Languages.
Sci. Ann. Cuza Univ., 1993

Substitution on Words and Languages.
Proceedings of the Developments in Language Theory, 1993

1992
Valence grammars on a free generated group.
Bull. EATCS, 1992


  Loading...