The following pages link to Peter Leupold (Q553313):
Displaying 33 items.
- Bounded hairpin completion (Q553314) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- DNA splicing: Computing by observing (Q835999) (← links)
- Languages generated by iterated idempotency (Q868949) (← links)
- Uniformly bounded duplication languages (Q1763482) (← links)
- On the size complexity of hybrid networks of evolutionary processors (Q1763710) (← links)
- Evolution and observation -- a non-standard way to generate formal languages (Q1885900) (← links)
- Deciding top-down determinism of regular tree languages (Q2140513) (← links)
- A Hierarchy of Transducing Observer Systems (Q2799221) (← links)
- Transducing by observing length-reducing and painter rules (Q2877375) (← links)
- (Q2882391) (← links)
- Computing by Observing Insertion (Q2890210) (← links)
- 5′ → 3′ Watson-Crick AutomataWith Several Runs (Q3000291) (← links)
- (Q3416091) (← links)
- Uniformly bounded duplication codes (Q3512596) (← links)
- On Regularity-Preservation by String-Rewriting Systems (Q3540126) (← links)
- Primitive Words Are Unavoidable for Context-Free Languages (Q3564881) (← links)
- Closure of Language Classes Under Bounded Duplication (Q3617061) (← links)
- Bounded Hairpin Completion (Q3618601) (← links)
- Recognizing DNA Splicing (Q3618677) (← links)
- (Q4412114) (← links)
- (Q4453463) (← links)
- FINITELY EXPANDABLE DEEP PDAs (Q4922677) (← links)
- ON NON-PRIMITIVE PALINDROMIC CONTEXT-FREE LANGUAGES (Q4923280) (← links)
- (Q5061518) (← links)
- (Q5145147) (← links)
- Duplication Roots (Q5428240) (← links)
- DNA Computing (Q5494358) (← links)
- Machines, Computations, and Universality (Q5710874) (← links)
- (Q5740420) (← links)
- General Idempotency Languages Over Small Alphabets (Q5740529) (← links)
- Aspects of Molecular Computing (Q5901842) (← links)
- Membrane Computing (Q5901882) (← links)
