Peter Leupold
From MaRDI portal
Person:553313
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Deciding top-down determinism of regular tree languages (available as arXiv preprint) | 2022-05-20 | Paper |
| On the unavoidability of primitive words and other languages | 2022-03-11 | Paper |
| Complexity through the observation of simple systems | 2021-01-20 | Paper |
| Complexity through the observation of simple systems (available as arXiv preprint) | 2021-01-20 | Paper |
| General idempotency languages over small alphabets International Journal of Foundations of Computer Science | 2016-07-27 | Paper |
| Palindromes and primitivity | 2016-07-26 | Paper |
| A hierarchy of transducing observer systems Language and Automata Theory and Applications | 2016-04-08 | Paper |
| Transducing by observing length-reducing and painter rules RAIRO. Theoretical Informatics and Applications | 2014-08-22 | Paper |
| On non-primitive palindromic context-free languages International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
| finitely expandable deep PDAs Automata, Formal Languages and Algebraic Systems | 2013-06-03 | Paper |
| Computing by observing insertion Language and Automata Theory and Applications | 2012-06-08 | Paper |
| On McNaughton families of languages that are specified by some variants of monadic string-rewriting systems Fundamenta Informaticae | 2012-05-04 | Paper |
| Bounded hairpin completion Information and Computation | 2011-07-27 | Paper |
| 5′ → 3′ Watson-Crick AutomataWith Several Runs Fundamenta Informaticae | 2011-05-18 | Paper |
| Computing by observing: simple systems and simple observers Theoretical Computer Science | 2011-01-10 | Paper |
| Primitive words are unavoidable for context-free languages Language and Automata Theory and Applications | 2010-05-26 | Paper |
| DNA splicing: Computing by observing Natural Computing | 2009-08-31 | Paper |
| Membrane Computing Lecture Notes in Computer Science | 2009-05-15 | Paper |
| Aspects of Molecular Computing Lecture Notes in Computer Science | 2009-05-14 | Paper |
| Bounded Hairpin Completion Language and Automata Theory and Applications | 2009-04-02 | Paper |
| Recognizing DNA Splicing DNA Computing | 2009-04-02 | Paper |
| Closure of Language Classes Under Bounded Duplication Developments in Language Theory | 2009-03-26 | Paper |
| On Regularity-Preservation by String-Rewriting Systems Language and Automata Theory and Applications | 2008-11-20 | Paper |
| Uniformly bounded duplication codes RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
| Uniformly bounded duplication codes RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
| Uniformly bounded duplication codes RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
| Duplication Roots Developments in Language Theory | 2007-11-28 | Paper |
| Languages generated by iterated idempotency Theoretical Computer Science | 2007-02-26 | Paper |
| Observation of string-rewriting systems | 2007-01-19 | Paper |
| DNA Computing Lecture Notes in Computer Science | 2006-10-19 | Paper |
| Machines, Computations, and Universality Lecture Notes in Computer Science | 2005-12-08 | Paper |
| On the size complexity of hybrid networks of evolutionary processors Theoretical Computer Science | 2005-02-22 | Paper |
| Uniformly bounded duplication languages Discrete Applied Mathematics | 2005-02-22 | Paper |
| Evolution and observation -- a non-standard way to generate formal languages Theoretical Computer Science | 2004-11-12 | Paper |
| scientific article; zbMATH DE number 2051172 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1948500 (Why is no real title available?) | 2003-07-13 | Paper |
Research outcomes over time
This page was built for person: Peter Leupold
