Peter Leupold

Affiliations:
  • University of Bremen, Germany
  • University of Leipzig, Institute of Computer Science, Germany
  • Rovira i Virgili University, GRLMC, Tarragona, Spain (PhD 2006)


According to our database1, Peter Leupold authored at least 46 papers between 2002 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On the Unavoidability of Primitive Words and other Languages.
J. Autom. Lang. Comb., 2021

Deciding Top-Down Determinism of Regular Tree Languages.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2019
Computing by observing reductions in partial orders.
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

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

2016
General Idempotency Languages Over Small Alphabets.
Int. J. Found. Comput. Sci., 2016

2015
A Hierarchy of Transducing Observer Systems.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Transducing by observing length-reducing and painter rules.
RAIRO Theor. Informatics Appl., 2014

Reducing Squares in Suffix Arrays.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Is computation observer-relative?
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

2012
On Non-Primitive Palindromic Context-Free Languages.
Int. J. Found. Comput. Sci., 2012

Computing by Observing Change in Insertion/Deletion Systems.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Transducing by Observing and Restarting Transducers.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

Computing by Observing Insertion.
Proceedings of the Language and Automata Theory and Applications, 2012

2011
Computing by observing: Simple systems and simple observers.
Theor. Comput. Sci., 2011

Bounded hairpin completion.
Inf. Comput., 2011

On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems.
Fundam. Informaticae, 2011

Palindromes and Primitivity.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
5' -> 3' Watson-Crick AutomataWith Several Runs.
Fundam. Informaticae, 2010

On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

Transducing by Observing.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

Primitive Words Are Unavoidable for Context-Free Languages.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
DNA splicing: computing by observing.
Nat. Comput., 2009

Reducing Repetitions.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

5' → 3' Watson-Crick Automata with Several Runs.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

Bounded Hairpin Completion.
Proceedings of the Language and Automata Theory and Applications, 2009

Computing by Observing Changes.
Proceedings of the Natural Computing - 4th International Workshop on Natural Computing, 2009

2008
Complexity through the Observation of Simple Systems
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

On Regularity-Preservation by String-Rewriting Systems.
Proceedings of the Language and Automata Theory and Applications, 2008

How to make Biological Systems Compute: Simply Observe Them.
Proceedings of the 3rd International ICST Conference on Bio-Inspired Models of Network, 2008

How to Pop a Deep PDA Matters.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Languages generated by iterated idempotency.
Theor. Comput. Sci., 2007

Uniformly bounded duplication codes.
RAIRO Theor. Informatics Appl., 2007

Duplication Roots.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Languages Generated by Iterated Idempotencies.
PhD thesis, 2006

Observation of String-Rewriting Systems.
Fundam. Informaticae, 2006

Closure of Language Classes Under Bounded Duplication.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
On the size complexity of hybrid networks of evolutionary processors.
Theor. Comput. Sci., 2005

Uniformly bounded duplication languages.
Discret. Appl. Math., 2005

Recognizing DNA Splicing.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004
Evolution and observation--a non-standard way to generate formal languages.
Theor. Comput. Sci., 2004

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

Evolution and Observation: A Non-standard Way to Accept Formal Languages.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Partial Words for DNA Coding.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Formal Languages Arising from Gene Repeated Duplication.
Proceedings of the Aspects of Molecular Computing, 2004

2003
Evolution and Observation: A New Way to Look at Membrane Systems.
Proceedings of the Membrane Computing, International Workshop, 2003

2002
Roots and Powers of Regular Languages.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002


  Loading...