Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Victor Mitrana - MaRDI portal

Victor Mitrana

From MaRDI portal
(Redirected from Person:235180)
Person:170454

Available identifiers

zbMath Open mitrana.victorDBLP86/4985WikidataQ102302116 ScholiaQ102302116MaRDI QIDQ170454

List of research outcomes





PublicationDate of PublicationType
Networks of evolutionary processors: wheel graph simulation2024-06-10Paper
On the Degree of Extension of Some Models Defining Non-Regular Languages2024-04-09Paper
Jump complexity of finite automata with translucent letters2024-03-05Paper
Small networks of polarized splicing processors are universal2023-11-30Paper
DNA-guided assembly of nanocellulose meshes2023-10-16Paper
Networks of splicing processors: simulations between topologies2023-09-14Paper
Hairpin completions and reductions: semilinearity properties2023-09-08Paper
Networks of Polarized Splicing Processors2022-12-09Paper
SOME REMARKS ON HAIRPIN AND LOOP LANGUAGES2022-12-06Paper
Simulating polarization by random context filters in networks of evolutionary processors2022-05-31Paper
https://portal.mardi4nfdi.de/entity/Q50615192022-03-11Paper
Filters defined by random contexts versus polarization in networks of evolutionary processors2021-03-09Paper
https://portal.mardi4nfdi.de/entity/Q51465272021-01-26Paper
On the group memory complexity of extended finite automata over groups2020-11-09Paper
https://portal.mardi4nfdi.de/entity/Q49695472020-10-13Paper
Polarization: a new communication protocol in networks of bio-inspired processors2020-02-24Paper
Networks of splicing processors with evaluation sets as optimization problems solvers2020-01-06Paper
On the degrees of non-regularity and non-context-freeness2019-11-29Paper
Further properties of self-assembly by hairpin formation2019-10-10Paper
Networks of picture processors as problem solvers2018-04-26Paper
Transducers based on networks of polarized evolutionary processors2017-06-15Paper
Prefix-suffix square reduction2017-06-15Paper
On the computational power of networks of polarized evolutionary processors2017-03-16Paper
Networks of polarized multiset processors2016-12-28Paper
https://portal.mardi4nfdi.de/entity/Q55070622016-12-16Paper
https://portal.mardi4nfdi.de/entity/Q28193862016-09-29Paper
Primitive morphisms2016-06-09Paper
Ambiguity of the Multiple Interpretations on Regular Languages2016-05-11Paper
Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results2016-02-17Paper
Hairpin lengthening: language theoretic and algorithmic results2016-01-28Paper
Networks of polarized evolutionary processors2016-01-14Paper
Bounded Prefix-Suffix Duplication2014-09-26Paper
Prefix-suffix duplication2014-06-10Paper
Accepting Networks of Evolutionary Picture Processors2014-05-12Paper
Networks of Polarized Evolutionary Processors Are Computationally Complete2014-03-31Paper
https://portal.mardi4nfdi.de/entity/Q28517092013-10-02Paper
Accepting splicing systems with permitting and forbidding words2013-06-26Paper
Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-001105082013-05-24Paper
Uniform Distributed Pushdown Automata Systems2012-11-02Paper
Hairpin Lengthening and Shortening of Regular Languages2012-11-01Paper
Deciding regularity of hairpin completions of regular languages in polynomial time2012-10-11Paper
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries2012-03-23Paper
Splicing Systems: Accepting Versus Generating2011-09-09Paper
On the Degree of Team Cooperation in CD Grammar Systems2011-07-29Paper
The role of evolutionary operations in accepting hybrid networks of evolutionary processors2011-07-27Paper
Bounded hairpin completion2011-07-27Paper
https://portal.mardi4nfdi.de/entity/Q30189672011-07-27Paper
Context Insertions2011-06-24Paper
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors2011-05-23Paper
FILTER POSITION IN NETWORKS OF SUBSTITUTION PROCESSORS DOES NOT MATTER2011-02-23Paper
SOME REMARKS ON THE HAIRPIN COMPLETION2010-11-11Paper
Hairpin Lengthening2010-07-29Paper
https://portal.mardi4nfdi.de/entity/Q35681332010-06-17Paper
Accepting splicing systems2010-05-27Paper
A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors2010-05-10Paper
Small universal accepting hybrid networks of evolutionary processors2010-05-05Paper
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size2010-03-24Paper
Remarks on arbitrary multiple pattern interpretations2010-01-29Paper
DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS2010-01-29Paper
Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof2010-01-07Paper
Perspectives of System Informatics2010-01-05Paper
Accepting Networks of Non-inserting Evolutionary Processors2009-11-10Paper
Networks of Evolutionary Picture Processors with Filtered Connections2009-10-22Paper
On the Hairpin Completion of Regular Languages2009-08-20Paper
Some Remarks on Superposition Based on Watson-Crick-Like Complementarity2009-07-07Paper
On some algorithmic problems regarding the hairpin completion2009-06-24Paper
Aspects of Molecular Computing2009-05-14Paper
Bounded Hairpin Completion2009-04-02Paper
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes2009-04-02Paper
Accepting Networks of Splicing Processors with Filtered Connections2009-03-05Paper
On small, reduced, and fast universal accepting networks of splicing processors2009-03-02Paper
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction2009-03-02Paper
https://portal.mardi4nfdi.de/entity/Q35184102008-08-07Paper
Uniformly bounded duplication codes2008-07-21Paper
All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size2008-04-04Paper
Returning and non-returning parallel communicating finite automata are equivalent2008-02-15Paper
Hairpin Completion Versus Hairpin Reduction2007-11-13Paper
On the size complexity of universal accepting hybrid networks of evolutionary processors2007-09-06Paper
Non-preserving splicing with delay2007-07-16Paper
On Some Algorithmic Problems Regarding the Hairpin Completion2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34312392007-04-10Paper
Accepting networks of splicing processors: complexity results2007-03-12Paper
https://portal.mardi4nfdi.de/entity/Q34099902006-11-21Paper
Superposition based on Watson-Crick-like complementarity2006-10-25Paper
DNA Computing2006-10-19Paper
https://portal.mardi4nfdi.de/entity/Q54860052006-09-06Paper
New Computational Paradigms2006-01-11Paper
Modeling and Using Context2005-12-15Paper
Machines, Computations, and Universality2005-12-08Paper
Synchronized shuffles2005-09-22Paper
Structural, Syntactic, and Statistical Pattern Recognition2005-08-24Paper
https://portal.mardi4nfdi.de/entity/Q46813062005-06-23Paper
PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES2005-06-22Paper
Hybrid networks of evolutionary processors are computationally complete2005-04-15Paper
Uniformly bounded duplication languages2005-02-22Paper
On the size complexity of hybrid networks of evolutionary processors2005-02-22Paper
Theory Is Forever2005-01-18Paper
On differentiation functions, structure functions, and related languages of context-free grammars2004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q44740062004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44740102004-08-04Paper
Teams of pushdown automata2004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44653402004-05-27Paper
Networks of evolutionary processors2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q44532282004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44495392004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44520642004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44378152003-12-15Paper
https://portal.mardi4nfdi.de/entity/Q44368322003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q44343562003-11-06Paper
https://portal.mardi4nfdi.de/entity/Q44313692003-10-22Paper
On some operations on strings suggested by gene assembly in ciliates2003-10-20Paper
https://portal.mardi4nfdi.de/entity/Q44138382003-07-21Paper
On the sentence valuation in a semiring2003-06-09Paper
Multiple pattern interpretations2003-04-27Paper
https://portal.mardi4nfdi.de/entity/Q47820962002-11-27Paper
Towards biolinguistics2002-10-08Paper
https://portal.mardi4nfdi.de/entity/Q45505422002-08-25Paper
Group weighted finite transducers.2002-08-14Paper
https://portal.mardi4nfdi.de/entity/Q43290282002-07-30Paper
Some undecidable problems for parallel communicating finite automata systems2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q45322202002-06-04Paper
https://portal.mardi4nfdi.de/entity/Q27801622002-04-15Paper
Formal properties of PA-matching2002-03-03Paper
Operations and language generating devices suggested by the genome evolution2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27706702002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q27425882001-09-23Paper
FINITE AUTOMATA OVER FREE GROUPS2001-04-17Paper
Extended finite automata over groups2001-04-04Paper
https://portal.mardi4nfdi.de/entity/Q27075322001-04-03Paper
https://portal.mardi4nfdi.de/entity/Q45208092001-02-27Paper
Patterns and languages: An overview2001-02-20Paper
PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS2001-02-11Paper
https://portal.mardi4nfdi.de/entity/Q45222462000-12-19Paper
Evolutionary systems: A language generating device inspired by evolving communities of cells2000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q44964872000-11-09Paper
https://portal.mardi4nfdi.de/entity/Q45031532000-09-04Paper
Colonies with limited activation of components2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49408882000-04-06Paper
https://portal.mardi4nfdi.de/entity/Q49390062000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q49391872000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q49391982000-02-23Paper
Stack cooperation in multistack pushdown automata1999-11-09Paper
https://portal.mardi4nfdi.de/entity/Q42693991999-10-31Paper
Chomsky-Schutzenberger type characterizations based on contextual languages1999-05-31Paper
https://portal.mardi4nfdi.de/entity/Q44215811999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38379931998-12-10Paper
Cooperation in context-free grammars1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43905351998-05-26Paper
https://portal.mardi4nfdi.de/entity/Q43712471998-01-11Paper
https://portal.mardi4nfdi.de/entity/Q43556821997-11-20Paper
On the interdependence between shuffle and crossing-over operations1997-06-16Paper
https://portal.mardi4nfdi.de/entity/Q48926111997-05-13Paper
https://portal.mardi4nfdi.de/entity/Q31251731997-03-16Paper
Pattern systems1997-02-28Paper
Binary self-adding sequences and languages11997-02-13Paper
https://portal.mardi4nfdi.de/entity/Q48848851996-11-17Paper
https://portal.mardi4nfdi.de/entity/Q48787231996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48867941996-07-23Paper
https://portal.mardi4nfdi.de/entity/Q48412751996-07-14Paper
https://portal.mardi4nfdi.de/entity/Q48647941996-06-27Paper
https://portal.mardi4nfdi.de/entity/Q48533131996-02-13Paper
https://portal.mardi4nfdi.de/entity/Q43111961995-09-11Paper
https://portal.mardi4nfdi.de/entity/Q43206531995-02-02Paper
https://portal.mardi4nfdi.de/entity/Q42965941994-07-13Paper
https://portal.mardi4nfdi.de/entity/Q31376841994-05-15Paper
https://portal.mardi4nfdi.de/entity/Q42906111994-05-05Paper
On languages satisfying “interchange Lemma”1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40052041992-09-27Paper
The modular grammars1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38200341988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38200351988-01-01Paper

Research outcomes over time

This page was built for person: Victor Mitrana