Scientific Publications

2015

• N. Hundeshagen and P. Leupold:
  A Hierarchy of Transducing Observer Systems.
  In: Proceedings of Languages, Automata Theory and Applications 2015, Lecture Notes in Computer Science 8977, Springer, Berlin, 2015, pp. 727--738.
  



2014

• N. Hundeshagen and P. Leupold:
  Transducing by observing length-reducing and painter rules.
  In: RAIRO Informatique Théorique 48(1), 2014, pp. 85--105.
  


• P. Leupold:
  Reducing Repetitions.
  In: Proceedings of Prague Stringology Days, Prague, 2014, pp. 192--201.
  


• P. Leupold:
  Is Computation Observer-Relative?
  In: Proceedings of Sixth Workshop on Non-Classical Models for Automata and Applications --- NCMA 2014, Series books@ocg.at 304, Austrian Computer Society, Graz, 2014, pp. 13--27.
  


• P. Leupold:
  What is the Role of the Observer in a Computation?
  In: Proceedings of 7th AISB Symposium on Computing and Philosophy, London 2014.
  



2012

• S. Zsolt Fazekas, P. Leupold and K. Shikishima-Tsuji:
  On Non-Primitive Palindromic Context-Free Languages.
  In: International Journal of Foundations of Computer Science 23 (6), 2012, pp. 1277--1290.
  


• N. Hundeshagen and P. Leupold:
  Transducing by Observing and Restarting Transducers.
  In: Proceedings of Fourth Workshop on Non-Classical Models for Automata and Applications --- NCMA 2012, Series books@ocg.at 290, Austrian Computer Society, Graz, 2012, pp. 93--106.
  


• P. Leupold:
  Computing by Observing Change in Insertion/Deletion Systems.
  In: Proceedings of Fourth Workshop on Non-Classical Models for Automata and Applications --- NCMA 2012, Series books@ocg.at 290, Austrian Computer Society, Graz, 2012, pp. 123--132.
  


• A. Krassovitskiy and P. Leupold:
  Computing by Observing Insertion.
  In: Proceedings of Languages, Automata Theory and Applications 2012, Lecture Notes in Computer Science 7183, Springer, Berlin, 2012, pp. 377--388.
  



2011

• P. Leupold and F. Otto:
  On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems.
  In: Fundamenta Informaticae 112, 2011, pp. 219--238.
  


• M. Ito, P. Leupold, F. Manea and V. Mitrana:
  Bounded Hairpin Completion.
  In: Information and Computation 209, 2011, pp. 471--485.
  


• M. Cavaliere and P. Leupold:
  Computing by Observing: Simple Systems and Simple Observers.
  In: Theoretical Computer Science 412(1-2), 2011, pp. 113--123.
  



2010

• P. Leupold and B. Nagy: . In: Fundamenta Informaticae 104(1-2), 2010, pp. 71.91.:
  5' -> 3' Watson-Crick Automata With Several Runs.
  In: Fundamenta Informaticae 104(1-2), 2010, pp. 71--91.
  



2009

• Peter Leupold:
  Reducing Repetitions.
  In: Holub, J. and Zdarek, J. (ed.): Prague Stringology Conference, 2009.
  


• Peter Leupold and Benedek Nagy:
  5' to 3' Watson-Crick Automata with Several Runs.
  In: Non-Classical Models of Automata and Applications (NCMA), 2009.
  


• Matteo Cavaliere and Peter Leupold:
  Computing by Observing Changes.
  In: IWNC, 2009.
  


• Matteo Cavaliere, Natasa Jonoska, and Peter Leupold:
  DNA Splicing: Computing by Observing.
  In: Natural Computing.
  


• Masami Ito, Peter Leupold and Victor Mitrana:
  Bounded Hairpin Completion.
  In: LATA, 2009.
  


• Peter Leupold, Remco Loos and Florin Manea:
  Complexity Aspects of the Recognition of Regular and Context-Free Languages by Accepting Hybrid Networks of Evolutionary Processorsn.
  In: Romanian Journal of Information Science and Technology, 2009.
  



2008

• Matteo Cavaliere and Peter Leupold:
  Complexity through the Observation of Simple Systems.
  Invited for presentation at International Workshop on The Complexity of Simple Programs 2008, Cork.
  


• Peter Leupold:
  How to make Biological Systems Compute: Simply Observe Them.
  In: Proceedings of The 2nd Workshop on Computing and Communications from Biological Systems: Theory and Applications (CCBS) 2008, Hyogo, ACM Digital Library.
  


• Peter Leupold:
  How to Pop a Deep PDA Matters.
  In: Automata and Formal Languages 2008, Balatonfüred.
  


• Peter Leupold:
  On Regularity Preservation.
  In: Proceedings of Languages, Automata Theory and Applications, Lecture Notes in Computer Science.
  


• Peter Leupold:
  Regularity Preservation by String-Rewriting Systems .
  In: Proceedings Workshop Algorithmic and Computational Theory in Algebra and Languages, Research Institute for Mathematical Sciences, Kyoto, Kokyuruko Series.
  

2007

• Peter Leupold and Victor Mitrana:
  Uniformly Bounded Duplication Codes.
  In: RAIRO Informatique Théorique 41 (4), 2007, pp. 411--424.
  


• Peter Leupold:
  Languages Generated by Iterated Idempotencies.
  In: Theoretical Computer Science 370(1-3), 2007, pp. 170--185.
  


• Peter Leupold:
  Duplication Roots.
  In: Developments in Language Theory 2007, Lecture Notes in Computer Science 4588, Springer, Berlin, 2007, pp. 290--299.

2006

• Matteo Cavaliere and Peter Leupold:
  Observation of String-Rewriting Systems.
  In: Fundamenta Informaticae 74(4), 2006, pp. 447--462.
  


• Masami Ito, Peter Leupold, and Kayoko Shikishima-Tsuji:
  Closure of Language Classes under Bounded Duplication.
  In: Developments in Language Theory 2006, Lecture Notes in Computer Science 4036, Springer, Berlin, 2006, pp. 238--247.
  


• Peter Leupold:
  Duplication Roots -- Extended Abstract.
  In: Proceedings Theorietag Automaten und Formale Sprachen, TU Wien, Wien, 2006, pp. 91--93.

2005

• Peter Leupold, Carlos Martín Vide and Victor Mitrana:
  Uniformly Bounded Duplication Languages.
  In: Discrete Applied Mathematics Vol 146, Iss 3, 2005, pp. 301--310.
  


• Juan Castellanos, Peter Leupold, and Victor Mitrana:
  On the Size Complexity of Hybrid Networks of Evolutionary Processors.
  In: Theoretical Computer Science 330, 2005, pp. 205--220.
  


• Matteo Cavaliere}, Natasa Jonoska, and Peter Leupold:
  DNA Splicing: Computing by Observing.
  In: DNA 11, Lecture Notes in Computer Science 3354, Springer, Berlin, 2005, pp. 152--162.
  


• Peter Leupold:
  Partial Words for DNA Coding.
  In: DNA 10, Lecture Notes in Computer Science 3384, Springer, Berlin, 2005, pp.224-234.
  


• Matteo Cavaliere and Peter Leupold:
  Evolution and Observation --- A Non-Standard Way to Accept Formal Languages.
  In: MCU 2004, Lecture Notes in Computer Science 3354, Springer-Verlag, Berlin, 2005, pp. 152--162.

2004

• Peter Leupold:
  Languages of Partial Words - How to Obtain Them and What Properties They Have.
  Grammars, Vol 7, 2004, pp. 179--192.
  


• Matteo Cavaliere and Peter Leupold:
  Evolution and Observation --- A Non-Standard Way to Generate Formal Languages.
  In: Theoretical Computer Science 321, 2004, pp. 233--248.
  


• Peter Leupold:
  n-Bounded Duplication Codes.
  Proceedings of the ICALP-Workshop on Words, Avoidability, Complexity, Turku 2004. Technical Report 2004-07, Laboratoire de Recherche en Informatique d'Amiens, Amiens 2004.
  


• Peter Leupold, Victor Mitrana and Jose Sempere:
  Formal Languages Arising from Gene Repeated Duplication.
  In: Aspects of Molecular Computing. Essays Dedicated to Tom Head on the Occasion of his 70th Birthday. LNCS 2950, Springer Verlag, Berlin, 2004, pp. 297--308.


• Matteo Cavaliere and Peter Leupold:
  Evolution and Observation -- A New Way to Look at Membrane Systems.
  In: Membrane Computing, International Workshop, WMC 2003, Revised Papers. Lecture Notes in Computer Science 2933, Springer-Verlag, Berlin, 2004, pp. 70--87.
  

2003

• Peter Leupold:
  Some Properties of Context-Free Languages Related to Primitive Words.
  In: Preproceedings of {\scshape Words'03}, TUCS General Publications, Turku, 2003.

2002

• Sándor Horváth, Peter Leupold and Gerhard Lischke}:
  Roots and Powers of Regular Languages.
  In: Developments in Language Theory 2002, Lecture Notes in Computer Science 2450, Springer-Verlag, Berlin, 2002, pp. 220--230.