Folgen
Peter Leupold
Peter Leupold
Bestätigte E-Mail-Adresse bei uni-bremen.de
Titel
Zitiert von
Zitiert von
Jahr
On the size complexity of hybrid networks of evolutionary processors
J Castellanos, P Leupold, V Mitrana
Theoretical Computer Science 330 (2), 205-220, 2005
462005
Partial words for DNA coding
P Leupold
International Workshop on DNA-Based Computers, 224-234, 2004
442004
Uniformly bounded duplication languages
P Leupold, C Martin-Vide, V Mitrana
Discrete Applied Mathematics 146 (3), 301-310, 2005
392005
Formal languages arising from gene repeated duplication
P Leupold, V Mitrana, JM Sempere
Aspects of Molecular Computing, 297-308, 2003
382003
Evolution and observation—a non-standard way to generate formal languages
M Cavaliere, P Leupold
Theoretical Computer Science 321 (2-3), 233-248, 2004
352004
Evolution and observation: A new way to look at membrane systems
M Cavaliere, P Leupold
International Workshop on Membrane Computing, 70-87, 2003
312003
5′→ 3′ Watson-Crick AutomataWith Several Runs
P Leupold, B Nagy
Fundamenta Informaticae 104 (1-2), 71-91, 2010
272010
Roots and powers of regular languages
S Horváth, P Leupold, G Lischke
International Conference on Developments in Language Theory, 220-230, 2002
232002
Closure of language classes under bounded duplication
M Ito, P Leupold, K Shikishima-Tsuji
International Conference on Developments in Language Theory, 238-247, 2006
222006
Bounded hairpin completion
M Ito, P Leupold, F Manea, V Mitrana
Information and Computation 209 (3), 471-485, 2011
202011
Languages of partial words
P Leupold
Grammars 7, 179-192, 2004
112004
Languages generated by iterated idempotency
P Leupold
Theoretical computer science 370 (1-3), 170-185, 2007
102007
DNA splicing: computing by observing
M Cavaliere, N Jonoska, P Leupold
Natural Computing 8 (1), 157-170, 2009
92009
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
92004
Duplication roots
P Leupold
International Conference on Developments in Language Theory, 290-299, 2007
82007
Finitely expandable deep PDAs
P Leupold, A Meduna
Automata, Formal Languages And Algebraic Systems, 113-123, 2010
72010
Reducing Repetitions.
P Leupold
Stringology, 225-236, 2009
72009
Some properties of context-free languages related to primitive words
P Leupold
Proceedings of Words 3, 2003
72003
Computing by observing: Simple systems and simple observers
M Cavaliere, P Leupold
Theoretical computer science 412 (1-2), 113-123, 2011
62011
Bounded hairpin completion
M Ito, P Leupold, V Mitrana
International Conference on Language and Automata Theory and Applications …, 2009
62009
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20