| On the size complexity of hybrid networks of evolutionary processors J Castellanos, P Leupold, V Mitrana Theoretical Computer Science 330 (2), 205-220, 2005 | 51 | 2005 |
| Partial words for DNA coding P Leupold International Workshop on DNA-Based Computers, 224-234, 2004 | 44 | 2004 |
| Uniformly bounded duplication languages P Leupold, C Martin-Vide, V Mitrana Discrete Applied Mathematics 146 (3), 301-310, 2005 | 42 | 2005 |
| Evolution and observation—a non-standard way to generate formal languages M Cavaliere, P Leupold Theoretical Computer Science 321 (2-3), 233-248, 2004 | 39 | 2004 |
| Formal languages arising from gene repeated duplication P Leupold, V Mitrana, JM Sempere Aspects of Molecular Computing: Essays Dedicated to Tom Head, on the …, 2004 | 38 | 2004 |
| 5′→ 3′ Watson-Crick AutomataWith Several Runs P Leupold, B Nagy Fundamenta Informaticae 104 (1-2), 71-91, 2010 | 33 | 2010 |
| Evolution and observation: A new way to look at membrane systems M Cavaliere, P Leupold Membrane Computing: International Workshop, WMC 2003, Tarragona, Spain, July …, 2004 | 32 | 2004 |
| Bounded hairpin completion M Ito, P Leupold, F Manea, V Mitrana Information and Computation 209 (3), 471-485, 2011 | 25 | 2011 |
| Closure of language classes under bounded duplication M Ito, P Leupold, K Shikishima-Tsuji Developments in Language Theory: 10th International Conference, DLT 2006 …, 2006 | 23 | 2006 |
| Roots and powers of regular languages S Horváth, P Leupold, G Lischke Developments in Language Theory: 6th International Conference, DLT 2002 …, 2003 | 23 | 2003 |
| Languages of partial words P Leupold Grammars 7, 179-192, 2004 | 12 | 2004 |
| Languages generated by iterated idempotency P Leupold Theoretical computer science 370 (1-3), 170-185, 2007 | 10 | 2007 |
| Finitely expandable deep PDAs P Leupold, A Meduna Automata, Formal Languages And Algebraic Systems, 113-123, 2010 | 9 | 2010 |
| DNA splicing: computing by observing M Cavaliere, N Jonoska, P Leupold Natural Computing 8, 157-170, 2009 | 9 | 2009 |
| Evolution and observation: A non-standard way to accept formal languages M Cavaliere, P Leupold International Conference on Machines, Computations, and Universality, 153-163, 2004 | 9 | 2004 |
| On regularity-preservation by string-rewriting systems P Leupold Language and Automata Theory and Applications: Second International …, 2008 | 8 | 2008 |
| Duplication roots P Leupold Developments in Language Theory: 11th International Conference, DLT 2007 …, 2007 | 8 | 2007 |
| Reducing Repetitions. P Leupold Stringology, 225-236, 2009 | 7 | 2009 |
| Some properties of context-free languages related to primitive words P Leupold Proceedings of Words 3, 2003 | 7 | 2003 |
| Computing by observing: Simple systems and simple observers M Cavaliere, P Leupold Theoretical computer science 412 (1-2), 113-123, 2011 | 6 | 2011 |
Kayoko Shikishima-TsujiVerifierad e-postadress på sta.tenri-u.ac.jp
