Peter Leupold - RankMe

47 papers B 3C 9Misc 2Journal 18Unranked 14

Year	Rank	Type	Title / Venue / Authors
2021	B	`conf`	Deciding Top-Down Determinism of Regular Tree Languages. FCT Peter Leupold, Sebastian Maneth
2021	J	`jnl`	Deciding Top-Down Determinism of Regular Tree Languages. CoRR Peter Leupold, Sebastian Maneth
2021	J	`jnl`	On the Unavoidability of Primitive Words and other Languages. J. Autom. Lang. Comb. Peter Leupold
2019	—	`conf`	Computing by observing reductions in partial orders. NCMA Peter Leupold
2018	J	`jnl`	The Role of Observers in Computations - How Much Computation Does it Take to Recognize a Computation? Minds Mach. Peter Leupold
2016	J	`jnl`	General Idempotency Languages Over Small Alphabets. Int. J. Found. Comput. Sci. Peter Leupold
2015	C	`conf`	A Hierarchy of Transducing Observer Systems. LATA Peter Leupold, Norbert Hundeshagen
2014	—	`conf`	Is computation observer-relative? NCMA Peter Leupold
2014	Misc	`conf`	Reducing Squares in Suffix Arrays. PSC Peter Leupold
2014	J	`jnl`	Transducing by observing length-reducing and painter rules. RAIRO Theor. Informatics Appl. Norbert Hundeshagen, Peter Leupold
2012	—	`conf`	Computing by Observing Change in Insertion/Deletion Systems. NCMA Peter Leupold
2012	C	`conf`	Computing by Observing Insertion. LATA Alexander Krassovitskiy, Peter Leupold
2012	J	`jnl`	On Non-Primitive Palindromic Context-Free Languages. Int. J. Found. Comput. Sci. Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji
2012	—	`conf`	Transducing by Observing and Restarting Transducers. NCMA Norbert Hundeshagen, Peter Leupold
2011	J	`jnl`	Bounded hairpin completion. Inf. Comput. Masami Ito, Peter Leupold, Florin Manea, Victor Mitrana
2011	J	`jnl`	Computing by observing: Simple systems and simple observers. Theor. Comput. Sci. Matteo Cavaliere, Peter Leupold
2011	J	`jnl`	On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems. Fundam. Informaticae Peter Leupold, Friedrich Otto
2011	—	`conf`	Palindromes and Primitivity. AFL Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji
2010	J	`jnl`	5' -> 3' Watson-Crick AutomataWith Several Runs. Fundam. Informaticae Peter Leupold, Benedek Nagy
2010	—	`conf`	On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems. NCMA Peter Leupold, Friedrich Otto
2010	C	`conf`	Primitive Words Are Unavoidable for Context-Free Languages. LATA Peter Leupold
2010	—	`conf`	Transducing by Observing. NCMA Norbert Hundeshagen, Peter Leupold
2009	—	`conf`	5' → 3' Watson-Crick Automata with Several Runs. NCMA Peter Leupold, Benedek Nagy
2009	C	`conf`	Bounded Hairpin Completion. LATA Masami Ito, Peter Leupold, Victor Mitrana
2009	—	`conf`	Computing by Observing Changes. IWNC Matteo Cavaliere, Peter Leupold
2009	J	`jnl`	DNA splicing: computing by observing. Nat. Comput. Matteo Cavaliere, Natasa Jonoska, Peter Leupold
2009	Misc	`conf`	Reducing Repetitions. PSC Peter Leupold
2008	—	`conf`	Complexity through the Observation of Simple Systems CSP Matteo Cavaliere, Peter Leupold
2008	—	`conf`	How to Pop a Deep PDA Matters. AFL Peter Leupold
2008	—	`conf`	How to make Biological Systems Compute: Simply Observe Them. BIONETICS Peter Leupold
2008	C	`conf`	On Regularity-Preservation by String-Rewriting Systems. LATA Peter Leupold
2007	C	`conf`	Duplication Roots. Developments in Language Theory Peter Leupold
2007	J	`jnl`	Languages generated by iterated idempotency. Theor. Comput. Sci. Peter Leupold
2007	J	`jnl`	Uniformly bounded duplication codes. RAIRO Theor. Informatics Appl. Peter Leupold, Victor Mitrana
2006	C	`conf`	Closure of Language Classes Under Bounded Duplication. Developments in Language Theory Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji
2006	—	`—`	Languages Generated by Iterated Idempotencies. Peter Leupold
2006	J	`jnl`	Observation of String-Rewriting Systems. Fundam. Informaticae Matteo Cavaliere, Peter Leupold
2005	J	`jnl`	On the size complexity of hybrid networks of evolutionary processors. Theor. Comput. Sci. Juan Castellanos, Peter Leupold, Victor Mitrana
2005	B	`conf`	Recognizing DNA Splicing. DNA Matteo Cavaliere, Natasa Jonoska, Peter Leupold
2005	J	`jnl`	Uniformly bounded duplication languages. Discret. Appl. Math. Peter Leupold, Carlos Martín-Vide, Victor Mitrana
2004	C	`conf`	Evolution and Observation: A Non-standard Way to Accept Formal Languages. MCU Matteo Cavaliere, Peter Leupold
2004	J	`jnl`	Evolution and observation--a non-standard way to generate formal languages. Theor. Comput. Sci. Matteo Cavaliere, Peter Leupold
2004	—	`conf`	Formal Languages Arising from Gene Repeated Duplication. Aspects of Molecular Computing Peter Leupold, Victor Mitrana, José M. Sempere
2004	J	`jnl`	Languages of Partial Words - How to Obtain Them and What Properties They Have. Grammars Peter Leupold
2004	B	`conf`	Partial Words for DNA Coding. DNA Peter Leupold
2003	—	`conf`	Evolution and Observation: A New Way to Look at Membrane Systems. Workshop on Membrane Computing Matteo Cavaliere, Peter Leupold
2002	C	`conf`	Roots and Powers of Regular Languages. Developments in Language Theory Sándor Horváth, Peter Leupold, Gerhard Lischke