Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Leupold
Person information
- affiliation: University of Bremen, Germany
- affiliation: University of Leipzig, Institute of Computer Science, Germany
- affiliation (PhD 2006): Rovira i Virgili University, GRLMC, Tarragona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]Peter Leupold:
On the Unavoidability of Primitive Words and other Languages. J. Autom. Lang. Comb. 26(1-2): 91-107 (2021)- [c28]Peter Leupold, Sebastian Maneth:
Deciding Top-Down Determinism of Regular Tree Languages. FCT 2021: 341-353 - [i1]Peter Leupold, Sebastian Maneth:
Deciding Top-Down Determinism of Regular Tree Languages. CoRR abs/2107.03174 (2021)
2010 – 2019
- 2019
- [c27]Peter Leupold:
Computing by observing reductions in partial orders. NCMA 2019: 125-138 - 2018
- [j16]Peter Leupold:
The Role of Observers in Computations - How Much Computation Does it Take to Recognize a Computation? Minds Mach. 28(3): 427-444 (2018) - 2016
- [j15]Peter Leupold:
General Idempotency Languages Over Small Alphabets. Int. J. Found. Comput. Sci. 27(3): 343-358 (2016) - 2015
- [c26]Peter Leupold, Norbert Hundeshagen:
A Hierarchy of Transducing Observer Systems. LATA 2015: 727-738 - 2014
- [j14]Norbert Hundeshagen, Peter Leupold:
Transducing by observing length-reducing and painter rules. RAIRO Theor. Informatics Appl. 48(1): 85-105 (2014) - [c25]Peter Leupold:
Is computation observer-relative? NCMA 2014: 13-27 - [c24]Peter Leupold:
Reducing Squares in Suffix Arrays. Stringology 2014: 192-201 - 2012
- [j13]Szilárd Zsolt Fazekas
, Peter Leupold, Kayoko Shikishima-Tsuji:
On Non-Primitive Palindromic Context-Free Languages. Int. J. Found. Comput. Sci. 23(6): 1277-1290 (2012) - [c23]Alexander Krassovitskiy, Peter Leupold:
Computing by Observing Insertion. LATA 2012: 377-388 - [c22]Norbert Hundeshagen, Peter Leupold:
Transducing by Observing and Restarting Transducers. NCMA 2012: 93-106 - [c21]Peter Leupold:
Computing by Observing Change in Insertion/Deletion Systems. NCMA 2012: 123-132 - 2011
- [j12]Peter Leupold, Friedrich Otto:
On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems. Fundam. Informaticae 112(2-3): 219-238 (2011) - [j11]Masami Ito, Peter Leupold, Florin Manea, Victor Mitrana:
Bounded hairpin completion. Inf. Comput. 209(3): 471-485 (2011) - [j10]Matteo Cavaliere, Peter Leupold:
Computing by observing: Simple systems and simple observers. Theor. Comput. Sci. 412(1-2): 113-123 (2011) - [c20]Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji:
Palindromes and Primitivity. AFL 2011: 184-196 - 2010
- [j9]Peter Leupold, Benedek Nagy:
5' -> 3' Watson-Crick AutomataWith Several Runs. Fundam. Informaticae 104(1-2): 71-91 (2010) - [c19]Peter Leupold:
Primitive Words Are Unavoidable for Context-Free Languages. LATA 2010: 403-413 - [c18]Norbert Hundeshagen, Peter Leupold:
Transducing by Observing. NCMA 2010: 85-98 - [c17]Peter Leupold, Friedrich Otto:
On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems. NCMA 2010: 113-126
2000 – 2009
- 2009
- [j8]Matteo Cavaliere, Natasa Jonoska, Peter Leupold:
DNA splicing: computing by observing. Nat. Comput. 8(1): 157-170 (2009) - [c16]Matteo Cavaliere, Peter Leupold:
Computing by Observing Changes. IWNC 2009: 133-140 - [c15]Masami Ito, Peter Leupold, Victor Mitrana:
Bounded Hairpin Completion. LATA 2009: 434-445 - [c14]Peter Leupold, Benedek Nagy:
5' → 3' Watson-Crick Automata with Several Runs. NCMA 2009: 167-180 - [c13]Peter Leupold:
Reducing Repetitions. Stringology 2009: 225-236 - 2008
- [c12]Peter Leupold:
How to Pop a Deep PDA Matters. AFL 2008: 281-291 - [c11]Peter Leupold:
How to make Biological Systems Compute: Simply Observe Them. BIONETICS 2008: 31 - [c10]Peter Leupold:
On Regularity-Preservation by String-Rewriting Systems. LATA 2008: 345-356 - [c9]Matteo Cavaliere, Peter Leupold:
Complexity through the Observation of Simple Systems. CSP 2008: 22-30 - 2007
- [j7]Peter Leupold, Victor Mitrana:
Uniformly bounded duplication codes. RAIRO Theor. Informatics Appl. 41(4): 411-424 (2007) - [j6]Peter Leupold:
Languages generated by iterated idempotency. Theor. Comput. Sci. 370(1-3): 170-185 (2007) - [c8]Peter Leupold:
Duplication Roots. Developments in Language Theory 2007: 290-299 - 2006
- [b1]Peter Leupold:
Languages Generated by Iterated Idempotencies. University of Rovira i Virgili, Spain, 2006 - [j5]Matteo Cavaliere, Peter Leupold:
Observation of String-Rewriting Systems. Fundam. Informaticae 74(4): 447-462 (2006) - [c7]Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji:
Closure of Language Classes Under Bounded Duplication. Developments in Language Theory 2006: 238-247 - 2005
- [j4]Peter Leupold, Carlos Martín-Vide, Victor Mitrana:
Uniformly bounded duplication languages. Discret. Appl. Math. 146(3): 301-310 (2005) - [j3]Juan Castellanos, Peter Leupold, Victor Mitrana:
On the size complexity of hybrid networks of evolutionary processors. Theor. Comput. Sci. 330(2): 205-220 (2005) - [c6]Matteo Cavaliere, Natasa Jonoska, Peter Leupold:
Recognizing DNA Splicing. DNA 2005: 12-26 - 2004
- [j2]Peter Leupold:
Languages of Partial Words - How to Obtain Them and What Properties They Have. Grammars 7: 179-192 (2004) - [j1]Matteo Cavaliere, Peter Leupold:
Evolution and observation--a non-standard way to generate formal languages. Theor. Comput. Sci. 321(2-3): 233-248 (2004) - [c5]Peter Leupold, Victor Mitrana, José M. Sempere:
Formal Languages Arising from Gene Repeated Duplication. Aspects of Molecular Computing 2004: 297-308 - [c4]Peter Leupold:
Partial Words for DNA Coding. DNA 2004: 224-234 - [c3]Matteo Cavaliere, Peter Leupold:
Evolution and Observation: A Non-standard Way to Accept Formal Languages. MCU 2004: 153-163 - 2003
- [c2]Matteo Cavaliere, Peter Leupold:
Evolution and Observation: A New Way to Look at Membrane Systems. Workshop on Membrane Computing 2003: 70-87 - 2002
- [c1]Sándor Horváth, Peter Leupold, Gerhard Lischke:
Roots and Powers of Regular Languages. Developments in Language Theory 2002: 220-230
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
