Roots and Powers of Regular Languages. - Sándor Horváth; Peter Leupold; Gerhard Lischke (Developments in Language Theory, 2002)

Evolution and Observation: A New Way to Look at Membrane Systems. - Matteo Cavaliere; Peter Leupold (Workshop on Membrane Computing, 2003)

Formal Languages Arising from Gene Repeated Duplication. - Peter Leupold; Victor Mitrana; José M. Sempere (Aspects of Molecular Computing, 2004)

Partial Words for DNA Coding. - Peter Leupold (DNA, 2004)

Evolution and Observation: A Non-standard Way to Accept Formal Languages. - Matteo Cavaliere; Peter Leupold (MCU, 2004)

Languages of Partial Words - How to Obtain Them and What Properties They Have. - Peter Leupold (Grammars, 2004)

Evolution and observation–a non-standard way to generate formal languages. - Matteo Cavaliere; Peter Leupold (Theor. Comput. Sci., 2004)

Recognizing DNA Splicing. - Matteo Cavaliere; Natasa Jonoska; Peter Leupold (DNA, 2005)

Uniformly bounded duplication languages. - Peter Leupold; Carlos Martín-Vide; Victor Mitrana (Discret. Appl. Math., 2005)

On the size complexity of hybrid networks of evolutionary processors. - Juan Castellanos; Peter Leupold; Victor Mitrana (Theor. Comput. Sci., 2005)

Closure of Language Classes Under Bounded Duplication. - Masami Ito; Peter Leupold; Kayoko Shikishima-Tsuji (Developments in Language Theory, 2006)

Observation of String-Rewriting Systems. - Matteo Cavaliere; Peter Leupold (Fundam. Informaticae, 2006)

Languages Generated by Iterated Idempotencies. - Peter Leupold (2006)

Duplication Roots. - Peter Leupold (Developments in Language Theory, 2007)

Uniformly bounded duplication codes. - Peter Leupold; Victor Mitrana (RAIRO Theor. Informatics Appl., 2007)

Languages generated by iterated idempotency. - Peter Leupold (Theor. Comput. Sci., 2007)

How to Pop a Deep PDA Matters. - Peter Leupold (AFL, 2008)

How to make Biological Systems Compute: Simply Observe Them. - Peter Leupold (BIONETICS, 2008)

On Regularity-Preservation by String-Rewriting Systems. - Peter Leupold (LATA, 2008)

Complexity through the Observation of Simple Systems - Matteo Cavaliere; Peter Leupold (CSP, 2008)

Computing by Observing Changes. - Matteo Cavaliere; Peter Leupold (IWNC, 2009)

Bounded Hairpin Completion. - Masami Ito; Peter Leupold; Victor Mitrana (LATA, 2009)

5' → 3' Watson-Crick Automata with Several Runs. - Peter Leupold; Benedek Nagy (NCMA, 2009)

Reducing Repetitions. - Peter Leupold (Stringology, 2009)

DNA splicing: computing by observing. - Matteo Cavaliere; Natasa Jonoska; Peter Leupold (Nat. Comput., 2009)

Primitive Words Are Unavoidable for Context-Free Languages. - Peter Leupold (LATA, 2010)

Transducing by Observing. - Norbert Hundeshagen; Peter Leupold (NCMA, 2010)

On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems. - Peter Leupold; Friedrich Otto (NCMA, 2010)

5' -> 3' Watson-Crick AutomataWith Several Runs. - Peter Leupold; Benedek Nagy (Fundam. Informaticae, 2010)

Palindromes and Primitivity. - Szilárd Zsolt Fazekas; Peter Leupold; Kayoko Shikishima-Tsuji (AFL, 2011)

On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems. - Peter Leupold; Friedrich Otto (Fundam. Informaticae, 2011)

Bounded hairpin completion. - Masami Ito; Peter Leupold; Florin Manea; Victor Mitrana (Inf. Comput., 2011)

Computing by observing: Simple systems and simple observers. - Matteo Cavaliere; Peter Leupold (Theor. Comput. Sci., 2011)

Computing by Observing Insertion. - Alexander Krassovitskiy; Peter Leupold (LATA, 2012)

Transducing by Observing and Restarting Transducers. - Norbert Hundeshagen; Peter Leupold (NCMA, 2012)

Computing by Observing Change in Insertion/Deletion Systems. - Peter Leupold (NCMA, 2012)

On Non-Primitive Palindromic Context-Free Languages. - Szilárd Zsolt Fazekas; Peter Leupold; Kayoko Shikishima-Tsuji (Int. J. Found. Comput. Sci., 2012)

Is computation observer-relative? - Peter Leupold (NCMA, 2014)

Reducing Squares in Suffix Arrays. - Peter Leupold (Stringology, 2014)

Transducing by observing length-reducing and painter rules. - Norbert Hundeshagen; Peter Leupold (RAIRO Theor. Informatics Appl., 2014)

A Hierarchy of Transducing Observer Systems. - Peter Leupold; Norbert Hundeshagen (LATA, 2015)

General Idempotency Languages Over Small Alphabets. - Peter Leupold (Int. J. Found. Comput. Sci., 2016)

The Role of Observers in Computations - How Much Computation Does it Take to Recognize a Computation? - Peter Leupold (Minds Mach., 2018)

Computing by observing reductions in partial orders. - Peter Leupold (NCMA, 2019)

Deciding Top-Down Determinism of Regular Tree Languages. - Peter Leupold; Sebastian Maneth (FCT, 2021)

On the Unavoidability of Primitive Words and other Languages. - Peter Leupold (J. Autom. Lang. Comb., 2021)