English Version


Data si locul nasterii: 4 august 1975, Curtea-de-Arges, Arges.

Educatia: Absolvent al Facultatii de Matematica, Universitatea Bucuresti, 1998. Master's of Science, Informatica, University of Western Ontario, Canada, 1999.
Teza de doctorat: "Unconventional models of computation: DNA and membrane computing", University of Western Ontario, Canada, 2003. Cond. stiintific: Dr. Sheng YU.
Pozitii academice: Conferentiar Universitar, Cercetator Stiintific gradul I (INCDSB), Conducator de doctorat in SUA din 2004 (3 doctoranzi supervizati ca unic conducator).
Cursuri predate: Limbaje formale, Retele de calculatoare, Analiza algoritmilor, Programare orientata pe obiecte, Programare in asamblare pentru microprocesoarele Intel, Introducere in Bioinformatica, Elemente de Biocomputing, Programare Procedurala etc.
Domenii de interes stiintific: Limbaje formale si automate, modele de calcul inspirat din biologie, Systems Biology si bioinformatica, simulare de fenomene intra-celulare in special cascadele de reactii legate de apoptoza.
Pagina personala: http://funinf.cs.unibuc.ro/~apaun/.

Premii si distinctii

Lucrarea: "The Power of Communication: P Systems with Symport/Antiport" a fost selectata de catre Thomson ISI Essential Science Indicators ca lucrare foarte influenta/citata si este estimata ca fiind intre cele mai bune 1% lucrari din domeniu. Fraza exacta de pe certificatul de la ISI este: "This means that the number of citations your article received places it in the top 1% within its field according to Essential Science Indicators. Your work is highly influential, and is making a significant impact among your colleagues in your field of study."

Membru in comisii, asociatii, colective de redactie

  • Membru in PC la conferinte academice internationale:
    • Program Committee member for Sixteenth International Meeting on DNA Computing (DNA 16), Hong Kong, China, June 14-17, 2010
    • Program Committee member for Fifteenth International Conference on Implementation and Application of Automata (CIAA2010) (Winnipeg, Manitoba, Canada, August 12-15, 2010)
    • Program Committee member for the 6th International Symposium on Bioinformatics Research and Applications (ISBRA'10), to be held on May 23-26, 2010 at the University of Connecticut in Storrs, CT.\
    • Program Committee member for Fifteenth International Meeting on DNA Computing (DNA 15), Fayetteville, Arkansas, USA, 2009
    • Program Committee member for Thirteenth International Conference on Implementation and Application of Automata (CIAA2008) (Santa Barbara, 2008)
    • Publicity Committee Co-Chair for Thirteenth International Conference on Implementation and Application of Automata (CIAA2008) (Santa Barbara, 2008)
    • Program Committee member for Third International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2008) Adelaide, Australia, 2008.
    • Program Committee member for First International Conference on Contemporary Computing (NOIDA, (outskirts of New Delhi), India 2008)
    • Program Committee member for Language Theory in Biocomputing 07 (Kingston, Canada 2007)
    • Program Committee member for Thirteenth International Meeting on DNA Computing (DNA13) (Memphis, USA, 2007)
    • Program Committee member for Eleventh International Conference on Implementation and Application of Automata (CIAA06) (Taipei, Taiwan 2006).
    • Student committee chair and organizer of UWORCS2002: U.W.O. Research in Computer Science, (London, Canada, 2002).
    • Organizing committee member for Fifth International Conference on Implementation and Application of Automata (CIAA 2000) and Half Century of Automata Theory Celebration and Inspiration (HCAT), London, Ontario, Canada, 2000.

Lucrari publicate in reviste internationale

  1. *O.H. Ibarra, A. Paun, A. Rodriguez-Paton, Sequential SNP systems based on min/max spike number, Theoretical Computer Science, vol. 410, iss. 30-32 (2009), 2982-2991 (Factor de impact ISI: 0,843).
  2. *A. Paun, M. Paun, A. Rodriguez-Paton, On the Hopcroft's minimization technique for DFA and DFCA, Theoretical Computer Science, vol. 410, iss. 24-25 (2009), 2424-2430 (Factor de impact ISI: 0,843).
  3. * J. Jack, A. Paun, A. Rodriguez-Paton, Discrete nondeterministic modeling of the FAS pathway, International Journal of Foundations of Computer Science, vol. 19 (October 2008), no. 5, pp. 1147-1162. (Factor de impact ISI:0,500)
  4. H. Chen, M. Ionescu, T.O. Ishdorj, A. Paun, Gh.Paun, M. Perez-Jimenez, Spiking neural P systems with extended rules: universality and languages. Nat. Comput. 7 (2008), no. 2, pp. 147-166. (revista ISI).
  5. O.H. Ibarra, A. Paun, Computing with Cells: Membrane Systems - Some Complexity Issues, International Journal of Parallel, Emergent and Distributed Systems, 23:5, 2008, pp. 347 -365
  6. O.H. Ibarra, S. Woodworth, F. Yu, A. Paun, On spiking neural P systems and partially blind counter machines. Nat. Comput. 7 (2008), no. 1, pp. 3–19. (revista ISI).
  7. A. Paun, Gh. Paun, Small universal spiking neural P systems, BioSystems, 90 (1), 2007, pp. 48-60. (Factor de impacto ISI:1,080)
  8. O. H. Ibarra, A. Paun, Gh. Paun, A. Rodriguez-Paton, P. Sosik, S. Woodworth; Normal forms for spiking neural P systems. Theoretical Computer Science 372(2-3), 2007, 196-217. (Factor de impact ISI: 0,843).
  9. *S. Cheruku, A. Paun, F.J. Romero-Campero, M.J. Perez-Jimenez, O.H. Ibarra; Simulating FAS-induced apoptosis by using P systems. Progress in Natural Science, 17(4), 2007, pp. 424-431. (Factor de impact ISI:0,531).
  10. *A. Paun, B. Popa; P Systems with Proteins on Membranes. Fundamenta Informaticae, 72, 4, 2006, 467-483. (Factor de impact ISI:0,586).
  11. *C. Campeanu, A. Paun, J.R. Smith, Incremental construction of minimal deterministic finite cover automata. Theoretical Computer Science, 363(2), 2006, 135-148 (Factor de impact ISI: 0,843).
  12. R. Freund, M. Oswald, A. Paun, Optimal Results for the Computational Completeness of Gemmating (Tissue) P Systems, International Journal of Foundations of Computer Science, 16(5), (2005), pp. 929-942. (Factor de impact ISI:0,500)
  13. *C. Campeanu, L. Kari, A. Paun, Results on Transforming NFA into DFCA, Fundamenta Informaticae, Vol 64 (2005), pp. 53-63. (Factor de impact ISI:0,586).
  14. R. Freund, A. Paun, P systems with active membranes and without polarizations, Journal of Universal Computer Science and Soft Computing, 9 (9), (2005), pp.657-663. (Factor de impact ISI:0,516)
  15. *S.N. Krishna, A. Paun, Results on Catalytic and Evolution-Communication P Systems, New Generation Computing, 22, 4 (2004), pp. 377-394. (Factor de impact ISI:0,694)
  16. *C. Campeanu, A. Paun, Counting the Number of Minimal DFCA Obtained by Merging States, International Journal of Foundations of Computer Science, Vol. 14, No. 6 (2003), pp. 995-1006. (Factor de impact ISI:0,500)
  17. R. Belu, A. Paun, A. Belu, Neural Networks in Instrumentation, Measurement and Control, Romanian Journal of Information Science and Technology, Vol. 6, No. 1-2, (2003), pp. 61-85. (ISI journal).
  18. M. Ionescu, C. Martin-Vide, A. Paun, Gh. Paun, Unexpected universality results for three classes of P systems with symport/antiport, Natural Computing, Vol. 2, issue 4, (2003), pp. 337-348. (revista ISI).
  19. A. Paun, Gh. Paun, G. Rozenberg, Computing by Communication in Networks of Membranes, International Journal of Foundations of Computer Science, Vol. 13, No. 6 (2002), pp. 779-798. (Factor de impact ISI:0,500)
  20. *C. Martin-Vide, A. Paun, G. Rozenberg, Membrane Systems with Coupled Transport: Universality and Normal Forms, Fundamenta Informaticae, 49, 1-3 (2002), pp. 1-15. (Factor de impact ISI:0,586).
  21. *A. Paun, Gh. Paun, The Power of Communication: P Systems with Symport /Antiport, New Generation Computing, 20, 3 (2002), pp. 295-305. (Factor de impact ISI:0,694)
  22. *A. Paun, P Systems with Global Rules, Theory Comput. Systems, 35, (2002), pp. 471-481. (Factor de impact ISI:0,769).
  23. *C. Campeanu, A. Paun, S. Yu, An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages, International Journal of Foundations of Computer Science, 13, 1 (2002), pp. 83-97. (Factor de impact ISI:0,500)
  24. *A. Paun, On P Systems with Partial Parallel Rewriting, Romanian Journal of Information Science and Technology, 4, 1-2 (2001), pp. 203-210. (revista ISI).
  25. L. Kari, A. Paun, String Operations Suggested by DNA Biochemistry: the Balanced Cut Operation, Words, Semigroups & Transductions (M. Ito, et. al., eds.), World Scientific, Singapore, 2001, pp. 275-287.
  26. *A. Paun, On the Diameter of Various Classes of H Systems, J. Automata, Languages and Combinatorics, 5, 3 (2000), pp. 315-324.
  27. A. Paun, On Time-Varying H systems, Bulletin of the EATCS, 67 (1999), pp. 157-164.
  28. *A. Paun, Controlled H Systems of a Small Radius, Fundamenta Informaticae, 31, 2 (1997), pp. 185-193. (Factor de impact ISI:0,586).

Lucrari la conferinte (toate referite de comitete internationale)

  1. O.H. Ibarra, A. Paun, A. Rodriguez-Paton, Sequentiality Induced by Spike Number in SNP Systems, Pre-proceedings of Fourteenth meeting on DNA Computing (DNA14), June 2-6, 2008, Prague, Czech Republic, pp. 36-47.
  2. J. Jack, A. Paun, A. Rodriguez-Paton, Effects of HIV-1 Proteins on the Fas-Mediated Apoptotic Signaling Cascade: A Computational Study of Latent CD4+ T Cell Activation, accepted at Ninth Workshop on Molecular Computation, WMC9, Edinburgh (UK) July 28-31, 2008, 20pp.
  3. A. Paun, M. Paun, A. Rodriguez-Paton, Hopcroft's minimization technique: queues or stacks?, CIAA 13, July 21-24, 2008, San Francisco, USA, Lecture Notes in Computer Science, Berlin, vol. 5148, 2008, pp. 78-91.
  4. A. Paun, B. Popa, P Systems with Proteins on Membranes and Membrane Division, Proc of. Tenth International Conference Developments in Language Theory (DLT 2006), June 26-29, 2006, Santa Barbara, CA, USA, Lecture Notes in Computer Science, Berlin, vol. 4036, 2006 pp. 292-303
  5. H. Nagda, A. Paun, A. Rodriguez-Paton, P Systems with Symport/Antiport and Time, Proc. of Workshop on Membrane Computing (at the crossroads of Cell Biology and Computing), WMC07, 17-21 July 2006, Lecture Notes in Computer Science, Berlin, vol. 4361, 2006, pp. 429-442.
  6. C. Campeanu, A. Paun, J. R. Smith, Tight Bounds for the State Complexity of Deterministic Cover Automata, Proc. of Descriptional Complexity of Formal Systems, 8th Workshop, June 21-23, 2006, Las Cruces, New Mexico, USA (9 pages).
  7. M. Ionescu, A. Paun, Gh. Paun, M.J. Perez-Jimenez, Computing with Spiking Neural P Systems: Traces and Small Universal Systems, Proc. of 12th Intern. Meeting on DNA Based Computers (DNA 2006), June 5-9, Seoul, Korea, Lecture Notes in Computer Science, Berlin, vol. 4287, 2006, pp. 1-16.
  8. O.H. Ibarra, S. Woodworth, F. Yu, A. Paun, On Spiking Neural P Systems and Partially Blind Counter Machines. Proc. Of 5th International Conference on Unconventional Computation (UC 2006), 4th-8th September 2006, York, UK, Lecture Notes in Computer Science, Berlin, vol. 4135, 2006, pp. 113-129.
  9. C. Campeanu, A. Paun, J. R. Smith, An Incremental Algorithm for Minimal Deterministic Finite Cover Automata, Proc. of Tenth International Conference on Implementation and Application of Automata (CIAA05), June 27–29, 2005, Sophia Antipolis, France, pp. 90-103; (the conference had approximately 30% acceptance rate) also in Lecture Notes in Computer Science, Berlin, vol. 3845, 2006, pp. 90-103.
  10. O.H. Ibarra, A. Paun, Counting Time in Computing with Cells, Proc. of 11th Intern. Meeting on DNA Based Computers (DNA11), June 6-9, 2005, London Ontario, Canada, pp. 112-128, also in Lecture Notes in Computer Science, Berlin, vol. 3892, 2006, pp. 112-128.
  11. C. Campeanu, A. Paun, NFA to DFCA Transformations For Binary Alphabets, Proc. of Ninth International Conference on Implementation and Application of Automata (CIAA 2004), Kingston, Canada (2004).
  12. C. Campeanu, A. Paun, Lower Bounds for NFA to DFCA Transformations, Proc. of Descriptional Complexity of Formal Systems, 6th Workshop, London, Ontario, Canada (2004) (10 pages).
  13. R. Freund, M. Oswald, A. Paun, Extended Gemmating P Systems are Computationally Complete with Four Membranes, Proc. of Descriptional Complexity of Formal Systems, 6th Workshop, London, Ontario, Canada (2004) (10 pages).
  14. R. Freund, M. Oswald, A. Paun, P systems generating trees, Proc. of Workshop on Membrane Computing 2004 (WMC5), Milano, Italy, 2004, pp. 221-232 also in Lecture Notes in Computer Science, 3365, Berlin, (2004), pp. 309-319.
  15. C. Campeanu, A. Paun, Computing Beyond the Turing Limit Using the H Systems, Proc. of the Tenth International Meeting on DNA Computing (DNA10), Milan, (2004), pp. 314-323 also in Lecture Notes in Computer Science, 3384, Berlin, (2005), pp. 24-34.
  16. F. Bernardini, A. Paun, Universality of Minimal Symport/Antiport: Five Membranes Suffice, Lecture Notes in Computer Science, 2933, Berlin, (2004), pp. 43-54.
  17. R. Freund, A. Paun, Membrane Systems with Symport/Antiport: Universality Results, Lecture Notes in Computer Science, 2597, Berlin, (2003), pp. 270-287.
  18. C. Campeanu, A. Paun, The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata, Proc. of 7th International Conference on Implementation and Application of Automata (CIAA 2002), Tours, France, 2002, pp. 71-80.
  19. M. Ionescu, C. Martin-Vide, A. Paun, Gh. Paun, Membrane Systems with Symport/Antiport: (Unexpected) Universality Results, Proc. of 8th Intern. Meeting on DNA Based Computers (DNA8) (M. Hagiya, A. Obuchi, eds.), Hokkaido University, Sapporo, Japan, 2002, pp. 151-160.
  20. A. Paun, P Systems with string-objects: Universality results, Proc. of Workshop on Membrane Computing (WMC-CdeA 2001), Curtea-de-Arges, Romania, 2001, pp. 229-242.
  21. A. Paun, On P Systems with Global Rules. Proc. of 7th Intern. Meeting on DNA Based Computers (DNA7) (N. Jonoska, N.C. Seeman, eds.), Tampa, Florida, USA, 2001, pp. 43-52.
  22. A. Paun, On P Systems with Active Membranes, Proc. of UMC2K, in Discrete Mathematics and Theoretical Computer Science, Springer (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), Brussels, Belgium, 2000, pp. 187-201.
  23. A. Paun, N. Santean, S. Yu, An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages, Proc. of Fifth International Conference on Implementation and Application of Automata (CIAA 2000) (M. Daley, M. Eramian, S. Yu, eds.), London, Ontario, 2000, pp. 233-241.
  24. A. Paun, On the Diameter of Various Classes of H Systems, Proc. of Intern. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS '99) (J. Dassow, D. Wotschke, eds.), Magdeburg, Germany, 1999, pp. 165-174.
  25. A. Paun, M. Paun, State and Transition Complexity of Watson-Crick Finite Automata, Proc. of Fundamentals of Computation Theory Conf. (FCT'99) Iasi, 1999, Lecture Notes in Computer Science, 1684, Springer-Verlag, Berlin, 1999, pp. 409-420.
  26. A. Paun, M. Paun, Controlled and Distributed H Systems of a Small Radius, Computing with Bio-Molecules; Theory and Experiments, Springer, Singapore, 1998, pp. 239-254.

Rapoarte tehnice

  1. R. Freund, A. Paun, P Systems with Active Membranes and without Polarizations, Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla Tech. Rep 01/2004, Second Brainstorming Week on Membrane Computing, Sevilla, Spain, Feb 2-7, 2004, pp. 193-205.
  2. S.N. Krishna, A. Paun, Some Universality Results on Evolution-Communication P Systems, Rovira i Virgili Univ., Tech. Rep. No. 26, Brainstorming Week on Membrane Computing; Tarragona, 2003, pp. 207-215.
  3. S.N. Krishna, A. Paun, Three Universality Results on P Systems, Rovira i Virgili Univ., Tech. Rep. No. 26, Brainstorming Week on Membrane Computing; Tarragona, 2003, pp. 198-206.
  4. A. Paun, A. Rodriguez-Paton, Further Remarks on P Systems with Symport Rules, An. Stiint. Univ. Al. I. Cuza Iasi Inform. 10 (2001), pp. 3-18.
  5. A. Paun, M. Paun, On the Membrane Computing Based on Splicing, Where Mathematics, Computer Science, Linguistics and Biology Meet (C. Martin-Vide, V. Mitrana, eds.), Kluwer, Dordrecht, 2001, pp. 409-422.

Capitole de carte

  1. O.H. Ibarra, A. Paun, Membrane Systems: A "Natural" Way of Computing with Cells, book chapter (chapter 3, 26 pages), in S. Rajasekaran, J.Reif, eds., Handbook of Parallel Computing: Models, Algorithms and Applications (Chapman & Hall/Crc Computer & Information Science Series), 2007, ISBN: 978-1584886235.
  2. A. Paun, I. Stanciu, A. Bancila, B. Popa, Calculabilitatea pe baza de membrane si proteine, book chapter in Bioinformatica vol II, Editura Tehnica, 131 pagini, 2008, ISBN: 978-973-31-2342-2.
  3. R. Freund, O. Ibarra, A. Paun, P. Sosik, H-C. Yen, Catalytic P systems, book chapter in Membrane Computing Handbook, to appear.
  4. O.H Ibarra, A. Leporati, A. Paun, S. Woodworth, Spiking Neural P Systems: Characterizations and Complexity, book chapter in Membrane Computing Handbook, to appear.

Carti

  1. A. Paun, Computability of the DNA and Cells: Splicing and Membrane Computing, SBEB Publishing, 378 pages, 2008, ISBN: 978-0-9802368-4-2.
  2. S. Yu, A. Paun, eds., Implementation and Application of Automata, Lecture Notes in Computer Science 2088, Springer-Verlag, Berlin, 2001. ISBN: 978-3540424918.
  3. A. Paun, M. Paun, Analiza Statistica Folosind Limbajul R, Editura Matrix, Bucuresti, 2009



Prof.dr. Mitrana Victor

  


Data si locul nasterii: 26 iunie 1958, Bucuresti.

Educatia: Absolvent al Facultatii de Matematica, Universitatea Bucuresti, 1986.

Teza de doctorat: 1993, "Sisteme distribuite de gramatici", Cond. stiintific: Dr. Gheorghe Paun.


 Pozitii academice:
   - Asistent 1991-1994,
   - Lector 1994-1999,
   - Conferentiar 1999-2002,
   - Profesor din 2002
   - Conducator de doctorat din 2005

 Cursuri predate:
   - Sisteme de gramatici,
   - L sisteme si aplicatii in generarea imaginilor,
   - Informatica,
   - Notiuni introductive de bioinformatica,
   - Bazele informaticii,
   - Algoritmica,
   - Tehnici de programare,
   - Limbaje formale si automate,
   - Calculabilitate si complexitate,
   - Algoritmica secventelor,
   - Structuri de date,
   - Algoritmi si programare,
   - Tehnici de programare,
   - Modele de calcul neconventional

 Domenii de interes stiintific: Limbaje formale si automate, complexitatea algoritmilor, modele de calcul inspirat din biologie, combinatorica pe cuvinte si secvente infinite, calculabilitate si decidabilitate.

 Premii si distinctii:
   - Premiul "Gheorghe Lazar" al Academiei Romane pe anul 1997
   - Bursa "Alexander von Humboldt" obtinuta prin competitie internationala
   - Bursa "Ramon y Cajal" obtinuta prin competitie internationala
   - Bursa NATO obtinuta prin competitie internationala
   - Pozitie de profesor invitat la Universitatea din Pisa pentru un an, obtinuta prin competitie internationala (declinata)
   - Bursa a guvernului spaniol obtinuta prin competitie internationala

 Membru in comisii, asociatii, colective de redactie:
   - Editor asociat la International Journal of Computational and Applied Mathematics
   - Editor la Journal of Universal Computer Science
   - Editor la Journal of Computer Science
   - Editor la International Journal of Applied Mathematics and Engineering Sciences
   - Editor la Analele Universitatii Bucuresti, seria Informatica
   - Membru in comisia din MEC privind acreditarea titlurilor de doctor, calitatii de conducator de doctorat, IOSUD
   - Membru in PC la cateva conferinte academice internationale: (ICWLC'2000, ECAI 2004 - Workshop on Symbolic Networks, DCFS 2004, IWINAC 2005, CIAA 2005, DCFS 2006, IWINAC 2007, LATA 2007, DCFS 2007).

 Activitate stiintifica:
   - Autor a doua carti in limba romana si o carte in limba engleza
   - Co-editor la patru carti publicate la Kluwer Academic, Taylor and Francis si Springer-Verlag (2).
   - Autor sau co-autor la 157 de lucrari publicate in jurnale, lucrari ale unor conferinte, carti colective
   - 55 articole in publicatii ISI
   - 89 articole in publicatii recenzate MathSciNet
   - 96 articole in publicatii recenzate Zentrallblatt Math
   - 86 artocole in publicatii recenzate DBLP
   - autor unic pentru 31 lucrari
   - 41 co-autori
   - 289 citari in 181 lucrari cu 135 autori

- Conferinte la universitati din Germania (Magdeburg, Frankfurt, Hamburg), Finlanda (Turku), Japonia (Kyoto, Tokyo), Italia (Rome, Pisa), Spania (Tarragona, Madrid, Valencia, Sevilia), Ungaria (Budapesta, Szeged), Belgia (Ghent, Bruxelles), Cehia (Praga, Opava), Olanda (Leiden), Austria (Viena), Turcia (Istanbul).

Carti

  1. V. Mitrana: Provocarea algoritmilor. Editura Agni, Bucuresti, 1995, 160 pagini.
  2. V. Mitrana: Bioinformatica. Editura L&S Infomat, Bucuresti, 1998, 196 pagini.
  3. V. Mitrana: New Developments in Formal Language Theory Inspired from Biology, Editura Universitatii din Bucuresti, 2001, 215 pagini.

Capitole in carti colective:

  1. C. Martin-Vide, V. Mitrana: Networks of Evolutionary Processors: Results and Perspectives. In Molecular Computational Models: Unconventional Approaches, Idea Group Publishing, Hershey, 2005, 78-114.

Carti editate:

  1. C. Martin-Vide, V. Mitrana: Where Do Mathematics, Computer Science, Linguistics and Biology Meet, Kluwer Academic, Dordrecht, 2000, 448 pagini.
  2. C. Martin-Vide, V. Mitrana: Grammars and Automata for String Processing. From Mathematics and Computer Science to Biology and Back, Taylor and Francis, London, 2003, 422 pagini.
  3. C. Martin-Vide, V. Mitrana, G. Paun: Formal Languages and Applications, Springer Verlag, Berlin, 2003, 624 pagini.
  4. Z. Esik, C. Martin-Vide, V. Mitrana: Recent Advances in Formal Languages and Applications, Springer-Verlag, Berlin, 2006, 351 pagini.

Numere speciale de jurnale ca editor invitat:

  1. V. Mitrana, Special Issue on the 1st International PhD School on Formal Languages and Applications, GRAMMARS vol.7 (2004).

Articole in jurnale:

  1. A. Atanasiu, V. Mitrana: The modular grammars. International Journal of Computer Mathematics, 30 (1989), 17-35.
  2. V. Mitrana: Grammar-gsm pairs. Annals of the University of Bucharest, Series Mathematics-Informatics, 3 (1990-1991), 64-71.
  3. V. Mitrana: Valence grammars on a free generated group. Bulletin of the EATCS, 47 (1992), 174-179.
  4. V. Mitrana: On languages satisfying the "interchange lemma". R.A.I.R.O./ Theoretical Informatics and Applications, 27, 1 (1993), 71-79.
  5. V. Mitrana: Some remarks on Paun-Salomaa sequences. Bulletin of the EATCS, 49 (1993), 175-178.
  6. V. Mitrana: Cooperating/distributed grammar systems with total activation. Studii Cercetari Matematice, 45, 1 (1993), 31-37.
  7. V. Mitrana: Hybrid cooperating/distributed grammar systems. Computers and Artificial Intelligence, 12, 1 (1993), 83-88.
  8. J. Dassow, V. Mitrana, Gh. Paun: Szilard languages associated to a cooperating distributed grammar system. Studii Cercetari Matematice, 45, 5 (1993), 403-413.
  9. E. Csuhaj-Varju, J. Dassow, V. Mitrana, Gh. Paun: Cooperation in grammar systems: universality, similarity, timing. Cybernetica, 36, 4 (1993), 271-286.
  10. A. Atanasiu, V. Mitrana: Parallel substitution on words and languages. Annals of the University Al.I.Cuza, Iasi, Inf., 2 (1993), 37-43.
  11. A. Mateescu, V. Mitrana, A. Salomaa: Dynamical teams in cooperating distributed grammar systems. Annals of the University of Bucharest, (1993-1994), 3-14.
  12. V. Mitrana, Gh. Paun, G. Rozenberg: Structuring grammar systems by priority and hierarchies. Acta Cybernetica, 11, 3 (1994), 189-204.
  13. V. Mitrana: Similarity in grammar systems. Fundamenta Informaticae, 24 (1995), 3, 251-257.
  14. V. Mitrana: Distributed catenation versus shuffle. Bulletin of the EATCS, 58 (1996), 163-167.
  15. V. Mitrana, Gh. Paun, G. Rozenberg, A. Salomaa: Pattern systems. Theoretical Computer Science, 154, 2 (1996), 183-201.
  16. J. Dassow, V. Mitrana: Splicing grammar systems, Computers and Artificial Intelligence, 15 (1996), 2-3, 109-122.
  17. J. Dassow, V. Mitrana, Gh. Paun, S. Vicolov: On determinism in cooperating distributed grammar systems. Publicationes Mathematicae, 48 (1996), 3-4, 217-231.
  18. J. Dassow, V. Mitrana: "Call by name" and "call by value" strategies in grammar systems. Annals of the University of Bucharest, 1 (1996), 29-40.
  19. L.Ilie, V. Mitrana: Binary self-adding languages and sequences. International Journal of Computer Mathematics, 62 (1996), 171-181.
  20. V. Mitrana: Iterated pattern languages. Journal of Automata, Languages and Combinatorics, 1 (1996), 4, 305-311.
  21. J. Dassow, V. Mitrana: Fairness in grammar systems. Acta Cybernetica 12 (1996), 331-345.
  22. V. Mitrana: On the interdependence between shuffle and crossing-over operations. Acta Informatica, 34 (1997), 257-267.
  23. J. Dassow, V. Mitrana: Cooperation in context-free grammar, Theoretical Computer Science, 180 (1997) 353-361.
  24. V. Mitrana: Some remarks on morphisms and primitivity. Bulletin of the EATCS, 62 (1997), 213-216.
  25. V. Mitrana: Crossover systems. A generalization of splicing systems. Journal of Automata, Languages and Combinatorics, 2 (1997), 3, 151-160.
  26. V. Mitrana: Primitive morphisms. Information Processing Letters, 64 (1997) 277-281.
  27. J. Dassow, V. Mitrana, A. Salomaa: Context-free evolutionary grammars and the structural language of nucleic acids. BioSystems, 4 (1997) 169-177.
  28. J. Dassow, V. Mitrana: On the leftmost derivations in cooperating grammar systems. Revue Roumaine de Mathematiques Pures et Appliquees, 43, 3-4 (1998), 361-374.
  29. V. Mitrana: Parallelism in contextual grammars. Fundamenta Informaticae, 33 (1998), 281-294.
  30. V. Mitrana: Chomsky-Schutzenberger type characterizations based on contextual languages, GRAMMARS, 1 (1988), 167-176.
  31. A. Atanasiu, V. Mitrana: On the error-tolerant closure of languages, Annals of the University of Bucharest, Mathematics-Informatics Series, 47 (1998) 5-14.
  32. C. Martin-Vide, V. Mitrana: Cooperation in contextual grammars, Romanian Journal of Information Science and Technology, 3 (1998) 231-241.
  33. J. Dassow, V. Mitrana: Stack cooperation in multi-stack pushdown automata, Journal of Computer and System Sciences, 58 (1999), 611-621.
  34. V. Mitrana, G. Rozenberg: Some properties of duplication grammars. Acta Cybernetica, 14, 1 (1999), 165-177.
  35. J. Dassow, V. Mitrana: D0L-pattern systems, Publicationes Mathematicae, 54 (1999), 653-666.
  36. V. Mitrana: Patterns and languages: An overview, GRAMMARS, 2, 2 (1999), 149-173.
  37. J. Dassow, V. Mitrana, Gh. Paun: On the regularity of duplication closure, Bulletin of the EATCS, 69 (1999), 133-137.
  38. E. Csuhaj-Varju, V. Mitrana: Evolutionary systems: A language generating device inspired by evolving communities of cells, Acta Informatica, 36, 11 (2000), 913-926.
  39. V. Mitrana: On the degree of communication in parallel communicating finite automata, Journal of Automata, Languages and Combinatorics, 5, 3 (2000), 301-314.
  40. J. Dassow, V. Mitrana: Finite automata over the free generated groups, International Journal of Algebra and Computation, 10, 6 (2000), 725-738.
  41. E. Csuhaj-Varju, C. Martin-Vide, V. Mitrana, G. Vaszil: Parallel communicating pushdown automata systems, International Journal of Foundations of Computer Science, 11, 4 (2000), 633-650.
  42. C. Martin-Vide, V. Mitrana: Parallel communicating automata systems. A survey. Invited article in Korean Journal of Computational and Applied Mathematics. An International Journal, 7 (2), 2000, 237-257.
  43. J. Kelemen, A. Kelemenova, C. Martin-Vide, V. Mitrana: Colonies with limited activation of components, Theoretical Computer Science, 244, 1-2 (2000), 289-298.
  44. E. Csuhaj-Varju, V. Mitrana: Dynamical teams in eco-grammar systems. Fundamenta Informaticae, 44, 1-2 (2000), 83-94.
  45. C. Martin-Vide, V. Mitrana: Uniquely parsable CD grammar systems, Journal of Universal Computer Science, 6, 9 (2000), 850-861.
  46. V. Mitrana, R. Stiebe: Extended finite automata over groups. Discrete Applied Mathematics, 108, 3 (2001), 247-260.
  47. S. Kobayashi, V.Mitrana, Gh. Paun, G. Rozenberg: Formal properties of PA-Matching, Theoretical Computer Science, 262, 1-2 (2001), 117-131.
  48. C. Martin-Vide, V. Mitrana: Some undecidable problems for parallel communicating finite automata systems, Information Processing Letters, 77, 5-6 (2001), 239-245.
  49. A. Kelemenova, J. Kelemen, V. Mitrana: Towards Biolinguistics. New developments in formal language theory inspired from biology, GRAMMARS, 4, 3 (2001), 187-203.
  50. M. Ito, C. Martin-Vide, V. Mitrana: Group weighted finite transducers, Acta Informatica, 38 (2001), 117-129.
  51. C. Martin-Vide, V. Mitrana, Gh. Paun: On the power of valuations in P systems, Computacion y Sistemas, 5,2 (2001), 120-128.
  52. M. Kudlek, V. Mitrana: Closure properties of multiset languages, Fundamenta Informaticae, 49, 1-3 (2001), 191-203.
  53. J. Dassow, V. Mitrana, A. Salomaa: Operations and language generating devices suggested by the genome evolution, Theoretical Computer Science, 270, 1-2 (2002), 701-738.
  54. R. Freund, C. Martin-Vide, V. Mitrana: On some operations suggested by gene assembly in ciliates. New Generation Computing, 20, 3 (2002), 279-293.
  55. C. Martin-Vide, A. Mateescu, V. Mitrana: Parallel finite automata systems communicating by states, International Journal of Foundation of Computer Science, 13, 5 (2002), 733-749.
  56. C. Martin-Vide, V. Mitrana: Grammars with bounded-life resources, Journal of Automata, Languages, and Combinatorics, 7, 4 (2002), 561-570.
  57. C. Martin-Vide, V. Mitrana, R. Stiebe: Weighted grammars and automata with threshold interpretation, Journal of Automata, Languages, and Combinatorics, 8, 2 (2003), 303-318.
  58. C. Martin-Vide, V. Mitrana: Networks of evolutionary processors: a survey, Theoria, 18 (2003), no.46, 59-70.
  59. M. Kudlek, C. Martin-Vide, V. Mitrana: Multiple pattern interpretations, GRAMMARS, 5 (2002), 223-238.
  60. J. Castellanos, C. Martin-Vide, V. Mitrana, J. Sempere: Networks of evolutionary processors, Acta Informatica, 39 (2003), 517-529.
  61. V. Mitrana, K.G. Subramanian, M. Tataram: Pictural Networks of Evolutionary Processors, Romanian Journal of Information Science and Technology, 6 (2003), no.1-2, 189-199.
  62. A. Atanasiu, C. Martin-Vide, V. Mitrana: On the sentence valuation in a semiring. Information Sciences, 151 (2003), 107-124.
  63. M. Kudlek, C. Martin-Vide, A. Mateescu, V. Mitrana: Contexts and the concept of mild context-sensitivity, Linguistics and Philosophy, 26, 6 (2003), 703-725.
  64. M. ter Beek, E. Csuhaj-Varju, V. Mitrana: Teams of pushdown automata, International Journal of Computer Mathematics, 81, 2 (2004), 141-156.
  65. I. Ardelean, M. Gheorghe, C. Martin-Vide, V. Mitrana: A computational model for cell differentiation, BioSystems, 76(2004), 1-3, 169-176.
  66. M. Gheorghe, V. Mitrana: A formal language based approach in biology, Comparative and Functional Genomics 5 (2004), 91-94.
  67. J. Dassow, V. Mitrana, G. Paun, R. Stiebe: On functions and related languages of context-free grammars, RAIRO/Theoretical Informatics and Applications, 38 (2004), 257-267.
  68. J. Castellanos, P. Leupold, V. Mitrana: On the size complexity of hybrid networks of evolutionary processors, Theoretical Computer Science, 330, 2 (2005) 205-220.
  69. P. Bottoni, A. Labella, V. Manca, V. Mitrana: Superposition Based on Watson-Cricklike complementarity, Theory of Computing Systems, 39, 4 (2006), 503-524.
  70. P. Leupold, C. Martin-Vide, V. Mitrana: Uniformly bounded duplication languages, Discrete Applied Mathematics, 146, 3 (2005), 301-310.
  71. V. Mitrana: Marcus external contextual grammars: from one to many dimensions, Fundamenta Informaticae, 54, 1-4 (2005), 307-316.
  72. E. Csuhaj-Varju, C. Martin-Vide, V. Mitrana: Hybrid NEPs are computationally complete, Acta Informatica, 41, 4-5 (2005), 257-272.
  73. M. ter Beek, C. Martin-Vide, V. Mitrana: Synchronized shuffles, Theoretical Computer Science, 341 (2005), 263-275.
  74. M. A. Grando, V. Mitrana: A possible connection between two theories: grammar systems and concurrent programming, Fundamenta Informatica, 76, 3 (2007), 325-336.
  75. F. Manea, C. Martin-Vide, V. Mitrana: Accepting networks of splicing processors: complexity results, Theoretical Computer Science, 371(2007), 72-82.
  76. F. Manea, V. Mitrana, D.C. Voinescu: Synchronized shuffle on backbones, Fundamenta Informaticae, 73, 1-2 (2006), 191-202.
  77. A. Choundary, K. Krithivasan, V. Mitrana: Returning and non-returning PCFA are equivalent, RAIRO/Theoretical Informatics and Applications, in press.
  78. F. Manea, C. Martin-Vide, V. Mitrana: On the size complexity of universal accepting hybrid networks of evolutionary processors, Mathematical Structures in Computer Science, in press.
  79. R. Loos, V. Mitrana: Non-preserving splicing with delay, International Journal of Computer Mathematics, in press.
  80. C. Martin-Vide, V. Mitrana: Remarks on multiple pattern interpretations, Information Processing Letters, 101, 5 (2007), 209-214.
  81. P. Leupold, V. Mitrana: Uniformly bounded duplication codes, RAIRO Theoretical Informatics and Applications, in press.
  82. F. Manea, V. Mitrana: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size, Information Processing Letters, in press.

Articole in lucrarile unor conferinte academice

  1. A. Atanasiu, V. Mitrana: O structura de convergenta pe spatiul seriilor formale de puteri, Proc. of the 6th National Symp. "Info-Iasi", Iasi, Romania, 1987, 41-49.
  2. A. Atanasiu, V. Mitrana: Queue automata. Decisions problems. Proc. of the Second Colloquium on Logics, Languages, Math. Linguistics, Brasov, Romania, 1988, 1-6.
  3. A. Atanasiu, V. Mitrana: Modular grammars. Generative power and properties of closure. Proc. of the Second Colloquium on Logics, Languages, Math. Linguistics, Brasov, Romania, 1988, 161-168.
  4. V. Mitrana: Leftmost derivation in modular grammars, Proc. of the 7th National Symp. "Info-Iasi", Iasi, Romania, 1989, 83-88.
  5. V. Mitrana: On grammatical interpretattion. Proc. of the Third Colloquium on Logics, Languages, Math. Linguistics, Brasov, Romania, 1991, 86-93.
  6. V. Mitrana: On grammatical similarity. Proc.of "Salodays in Computer Science", Hyperion Press, Bucharest, l993, 126-134.
  7. A. Atanasiu, V. Mitrana: Parallel substitution on words and languages. Proc. of the 9th ROSYCS '93, Iasi, 1993, 24-30.
  8. V. Mitrana: On some classes of grammar systems. Developments in Theoretical Computer Science, Proc. of the 7th IMYCS '92, Gordon and Breach Science Publishers, 1994, 153-162.
  9. A. Atanasiu, V. Mitrana: Substitution on words and languages. in Developments in language theory. At the Crossroads of Mathematics, Computer Science and Biology (A.Salomaa, G.Rozenberg, eds.), World Scientific Publishing, 1994, 51-60.
  10. A. Atanasiu, V. Mitrana: Formal cryptation systems. Proc. of COMP-Sec '94, Technical Military Academy of Romania, 1995, 29-36.
  11. V. Mitrana: Binary self-adding sequences. Developments in Language Theory. At the Crossroads of Mathematics, Computer Science and Biology, World Scientific Publishing, 1996, 62-68.
  12. L.Ilie, V. Mitrana: Crossing-over on languages. A formal representation of the recombination of genes in a chromosome. German Conference on Bioinformatics GCB '96, Leipzig, Germany, 1996, 87-93.
  13. J. Dassow, V. Mitrana: Evolutionary grammars: a grammatical model for genome evolution. Bioinformatics. Proceedings of GCB '96, Lecture Notes in Computer Science, 1278, Springer-Verlag, 1997, 199-209.
  14. J. Dassow, V. Mitrana: On some operations suggested by the genome evolution. Pacific Symposium on Biocomputing '97, Hawaii, 1997, 97-108.
  15. J. Dassow, V. Mitrana: The degree of parallelism in contextual grammars with the strategy of minimal competence. In Mathematical and Computational Analysys of Natural Language, Studies in Functional and Structural Linguistics 45, John Benjamins, Amsterdam, 1998, 3-16.
  16. J. Dassow, V. Mitrana, G. Paun: Point mutations in context-free languages. Proc. of DLT '97, 1997, 429-446.
  17. C. Martin-Vide, V. Mitrana: Cooperation in contextual grammars. In MFCS '98 Workshop on Grammar Systems. Proceedings, Silesian University, Institute of Computer Science, 1998, 289-302.
  18. A. Atanasiu, V. Mitrana: Distributed encryption systems. In Proc. of ROSYCS '98, 1998, 47-56.
  19. C. Martin-Vide, V. Mitrana: An algebraic model of synonymy. In MFCS '98 Workshop on Mathematical Linguisitics. Proceedings, University of Hamburg, Fachbereich Informatik, Bericht 213/1998, 107-115.
  20. V. Mitrana: On the degree of communication in parallel communicating finite automata, Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Otto-von-Guericke Universitat, 155-165, 1999.
  21. V. Mitrana, R. Stiebe: Extended finite automata over groups. Proc. of the 1st Conference on Semigroups and Algebraic Engineering, Aizu, World Scientific, 1999, 317-329.
  22. C. Martin-Vide, V. Mitrana: Uniquely parsable CD grammar systems, Sixth Intern. Workshop on Parsing Technologies IWPT 2000, 2000, 313-315.
  23. V. Mitrana: Parsability approaches in CD grammar systems, Proceedings of the Workshop in Grammar Systems, Bad Ischl, 2000, 165-185.
  24. C. Martin-Vide, V. Mitrana: P Systems with valuations, Proceedings of the Second International Conference on Unconventional Models of Computation UMC '2K, Springer Verlag, London, 2000, 154-166.
  25. V. Mitrana: Parallel communicating finite automata systems, Proc. of Algebraic Systems, Formal Languages and Computations, RIMS Kokyuroku, 2000, 178-191.
  26. J. Castellanos, C. Martin-Vide, V. Mitrana, J. Sempere: Solving NP-complete problems with networks of evolutionary processors, Proc. of the 6th International Work-Conference on Artificial and Natural Neural Networks, IWANN 2001, Lecture Notes in Computer Science 2048, Springer Verlag, Berlin, 2001, 621-628.
  27. E. Csuhaj-Varju, C. Martin-Vide, V. Mitrana: Multiset automata, Multiset Processing, Lecture Notes in Computer Science 2235, 2001, 69-84.
  28. M. Ito, C. Martin-Vide, V. Mitrana: Chomsky-Schutzenberger type characterizations of poly-slender and Parikh slender context-free languages, Proceedings of Formal Grammars/Mathematics of Languages FGMOL '01, 2001, 104-112.
  29. M. Kudlek, V. Mitrana: Normal forms for multiset grammars, Multiset Processing, Lecture Notes in Computer Science 2235, 2001, 135-146.
  30. C. Martin-Vide, V. Mitrana: Grammars with bounded-life resources, Proc. Descriptional Complexity of Automata, Grammars and Related Structures, DCAGRS '01, 2001, 214-222.
  31. S. Marcus, C. Martin-Vide, V. Mitrana, Gh. Paun: A new-old class of linguistically motivated regulated grammars, 7th International Conference on Computational Linguistics in Netherlands, CLIN 2001, Rodopi, Amsterdam, 2001, 111-125.
  32. M. Kudlek, V. Mitrana: Closure properties of multiset languages, Workshop on Membrane Computing, WMC2001, Curtea de Arges, August 20-25, 2001, 157-168.
  33. C. Martin-Vide, V. Mitrana, R. Stiebe: Weighted grammars and automata with maximum interpretation, Weighted Automata: Theory and Applications 2002, TUD-FI 20-02, 32-35.
  34. M. Kudlek, V. Mitrana: Considerations on a multiset model for membrane computing, Proc. Workshop in Membrane Computing (WMC 2002), Lecture Notes in Computer Science 2597, Springer Verlag, Berlin, 2003, 352-358.
  35. A. Atanasiu, C. Martin-Vide, V. Mitrana: On the sentence valuations in a semiring, (Invited lecture) Proc. International Conference Words, Languages and Combinatorics III, World Scientific, Singapore, 2003, 22-39.
  36. E. Csuhaj-Varju, V. Mitrana, G. Vaszil: Distributed automata systems: computational power, Developments in Language Theory (DLT 2003), Lecture Notes in Computer Science 2710, Springer Verlag, Berlin, 2003, 218-229.
  37. C. Martin-Vide, V. Mitrana, M.J. Perez-Jimenez, F. Sancho-Caparrini: Hybrid networks of evolutionary processors, Genetic and Evolutionary Computation Conference (GECCO 2003), Lecture Notes in Computer Science 2723, Springer Verlag, Berlin, 2003,401-412.
  38. M. Gheorghe, C. Martin-Vide, V. Mitrana, M.J. Perez-Jimenez: An agent based approach of collective foraging, International Work-Conference on Artificial and Natural Neural Networks (IWANN 2003), Lecture Notes in Computer Science 2686, Springer Verlag, Berlin, 2003, 638-645.
  39. M. ter Beek, E. Csuhaj-Varju, V. Mitrana: Teams of pushdown automata, International Conference on Perspectives of System Informatics (PSI 2003), Lecture Notes in Computer Science 2890, Springer-Verlag, Berlin, 2003, 329-337.
  40. I. Ardelean, M. Gheorghe, C. Martin-Vide, V. Mitrana: A computational model for cell differentiation, Workshop Pre-Proceedings, IPCAT2003, Lausanne, Switzerland, 2003, 275-287.
  41. C. Martin-Vide, V. Mitrana: Some remarks on multiple pattern interpretations, Proceeding of Mathematics of Languages (MOL 8), 2003, 105-117.
  42. V. Mitrana: Some complexity aspects of hybrid networks of evolutionary processors, Proc. Descriptional Complexity of Formal Systems (DCFS 2003) (Invited plenary lecture), 2003, 5-20.
  43. E. Csuhaj-Varju, C. Martin-Vide, V. Mitrana: Parallel communicating finite transducer systems, Computational Linguistics in the Netherlands (CLIN 2002), Language and Computers: Studies in Practical Linguistics, Rodopi, Amsterdam-NY, 2003, 9-24.
  44. C. Martin-Vide, V. Mitrana: A new uniform translocation distance, Structural, Syntactic, and Statistical Pattern Recognition SSPR 2004, LNCS 3138 (2004).
  45. M. Margenstern, V. Mitrana, M. Perez-Jimenez: Accepting hybrid networks of evolutionary systems, Proc. DNA Based Computers DNA 10, LNCS 3384 (2005), 235-246.
  46. M. A. Grando, V. Mitrana: Can PC grammar systems benefit from concurrent programming?, Grammar System Week, Budapest, 2004, 200-211.
  47. F. Manea, C. Martin-Vide, V. Mitrana: Solving 3CNF-SAT in linear time with WWW, Machines, Computability, Universality, MCU 2004, LNCS 3354, 2005, 269-280.
  48. F. Manea, C. Martin-Vide, V. Mitrana: Accepting networks of splicing processors, Computation in Europe CiE 2005, LNCS 3526 (2005) , 300-309.
  49. C. Martin-Vide, V. Mitrana: Contextual information systems, CONTEXT '05, LNAI 3554, 2005, 304-315.
  50. C. Martin-Vide, V. Mitrana: Remarks on multiple pattern interpretations, Automata and Formal Languages AFL05, 2005, 200-212.
  51. R. Loos, V. Mitrana: Non-preserving splicing with delay, DNA Based Computers DNA11, 2005, 237-249.
  52. F. Manea, C. Martin-Vide, V. Mitrana: A universal accepting hybrid network of evolutionary processors, First International Workshop on Developments in Computational Models, DCM '05, ENTCS 93 (2006), 15-24.
  53. C. Martin-Vide, V. Mitrana: Further properties of path-controlled grammars, Formal Grammars/Mathematics of Languages, FG-MOL10, CSLI Publications 2005, 139-150.
  54. D. Cheptea, C. Martin-Vide, V. Mitrana: A new operation on words suggested by DNA biochemistry: hairpin completion, Transgressive Computing, 2006, 216-228.
  55. C. Martin-Vide, V. Mitrana: Descriptional and computational aspects of generating and accepting hybrid networks of evolutionary processors, Proc. Conference on Algebraic Informatics CAI’05, 2005, 207-220.
  56. Florin Manea, Carlos Martin-Vide, Victor Mitrana: All NP-Problems can be solved in polynomial time by ANSP of constant size, DNA Based Computers DNA 12, LNCS 4287, 2006, 47-57.
  57. Remco Loos, Carlos Martin-Vide, Victor Mitrana: Solving SAT and HPP with accepting splicing systems, Parallel Problem Solving from Nature PPSN IX, LNCS 4193, 2006, 771-777.
  58. J. Castellanos, L.F. de Mingo Lopez, V. Mitrana: Solving SAT by accepting networks of splicing processors with filtered connections, 15th International Conference on Computing CIC 2006, IEEE Computer Society, 2006, 260-265.
  59. Florin Manea, Carlos Martin-Vide, Victor Mitrana: On some algorithmic problems regarding the hairpin completion, Optimal Discrete Structures and Algorithms ODSA 2006, Electronic Notes in Discrete Mathematics 27 (2006) 7172.
  60. F. Manea, V. Mitrana: Hairpin completion versus hairpin reduction, Computation in Europe CiE 2007, in press.

Articole in carti colective

  1. V Mitrana: Contextual grammars: the strategy of minimal competence. Mathematical Aspects of Natural and Formal Languages, World Scientific Publishing, 1994, 319-331.
  2. V. Mitrana: Contextual insertion and deletion. Mathematical Linguistics and Related Topics, The Publishing House of the Romanian Academy, 1994, 271-278.
  3. V. Mitrana: Eco-pattern systems. Artificial Life. Grammatical Models., The Black Sea Univ. Press, 1995, 202-209.
  4. V. Mitrana, R. Stiebe: The accepting power of finite automata over groups. New Trends in Formal Languages. Control, Cooperation, Combinatorics. LNCS 1218, Springer, 1997, 39-48.
  5. V. Mihalache, V. Mitrana: Deterministic cooperating distributed grammar systems. New Trends in Formal Languages. Control, Cooperation, Combinatorics. LNCS 1218, Springer, 1997, 137-149.
  6. V. Mitrana: On the degree of cooperation in CD grammar systems. Grammatical Models of Multi-Agent Systems, Gordon and Breach, 1999, 33-40.
  7. J. Dassow, V. Mitrana: Self-crossing-over systems. Computing with Bio-Molecules, Springer-Verlag Singapore, 1998, 283-294.
  8. A. Atanasiu, V. Mitrana: About symbolic encryption. Separable encryption systems. Grammatical Models of Multi-Agent Systems, Gordon and Breach, 1999, 218-225.
  9. C. Martin-Vide, V. Mitrana: On context-free duplications, Recent topics in mathematical and computational linguistics, The Publishing House of the Romanian Academy, 2000, 196-206.
  10. J. Kelemen, A. Kelemenova, V. Mitrana: Neo-modularity and colonies, Where Linguistics, Computer Science and Biology Do Meet, Kluwer Academic Publisher, 2000, 63-74.
  11. J. Castellanos, V. Mitrana: Some remarks on hairpin and loop languages, Words, Semigroups, and Tranlations, World Scientific, Singapore, 2001 47-59.
  12. L. Ilie, V. Mitrana: Crossing-over on languages. A formal representation of chromosomes recombination. In Grammars and Automata for String Processing. From Mathematics and Computer Science to Biology and Back, Gordon and Breach, 2003, 289-302.
  13. P. Leupold, V. Mitrana, J. Sempere: Formal languages arising from gene repeated duplication. Aspects of Molecular Computing, Lecture Notes in Computer Science 2950, Springer Verlag, Berlin, 2003, 297-308.
  14. P. Domosi, C. Martin-Vide, V. Mitrana: Remarks on sublanguages consisting of primitive words of slender regular and context-free languages, Theory Is Forever LNCS 3113, 2004, 60-68.
  15. J. Dassow, C. Martin-Vide, V. Mitrana: Free generating hybrid networks of evolutionary processors, Formal Models, Languages and Applications Series in Machine Perception and Artificial Intelligence vol. 66, 2006, World Scientific, Singapore, 65-78.

Rapoarte tehnice

  1. E. Csuhaj-Varju, J. Dassow, V. Mitrana, Gh. Paun: Cooperation in grammar systems: universality, similarity, timing. Technische Universit¨at "Otto von Guericke" Magdeburg, INF-4-93, 1993.
  2. L.Ilie, V. Mitrana: Crossing-over on languages. A formal representation of the recombination of genes in a chromosome. Turku Centre for Computer Science, TR 32, 1995.
  3. J. Dassow, V. Mitrana, A. Salomaa: Context-free evolutionary grammars and the structural language of nucleic acids. Turku Centre for Computer Science, TR 68, 1996.
  4. V. Mitrana: On morphisms preserving primitive words. Turku Centre for Computer Science, TR 69, 1996.
  5. V. Mitrana, Gh. Paun, G. Rozenberg, A. Salomaa: Pattern systems. Technical Report 94-20 (1994), University of Leiden, The Netherlands.
  6. V. Mitrana, R. Stiebe: The accepting power of finite automata over groups. Turku Centre for Computer Science, TR 70, 1996.
  7. V. Mihalache, V. Mitrana: Deterministic cooperating distributed grammar systems. Turku Centre for Computer Science, TR 63, 1996.
  8. V. Mitrana, G. Rozenberg, A. Salomaa: On the crossover distance, TUCS Technical Report No 223, 1998.
  9. A. Atanasiu, C. Martin-Vide, V. Mitrana: On the sentence valuations in a semiring. An approach to the study of synonymy, TUCS Technical Report No 224, 1998.
  10. M. ter Beek, C. Martin-Vide, V. Mitrana: Synchronized shuffles, Technical Report 2003-TR-40, Istituto di Scienza e Tecnologie dell 'Informazione, Consiglio Nazionale delle Ricerche, 2003.



Actualizat: 23 martie 2007



2002 - 2015 -- Facultatea de Matematica si Informatica, Universitatea din Bucuresti
Str. Academiei nr. 14, sector 1, C.P. 010014, Bucuresti, Romania
Tel: (4-021) 314 2863, Fax: (4-021) 315 6990, secretariat fmi.unibuc.ro