The following pages link to Rudolf Freund (Q198231):
Displayed 50 items.
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- Contextual array grammars and array P systems (Q499706) (← links)
- (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode (Q553919) (← links)
- On some operations on strings suggested by gene assembly in ciliates (Q698885) (← links)
- Multiset random context grammars, checkers, and transducers (Q872199) (← links)
- Applications of membrane systems in distributed systems (Q952192) (← links)
- How a membrane agent buys goods in a membrane store (Q952203) (← links)
- Real functions and numbers defined by Turing machines (Q1050122) (← links)
- Init and Anf operating on \(\omega\)-languages (Q1056238) (← links)
- (Q1277366) (redirect page) (← links)
- DNA computing based on splicing: The existence of universal computers (Q1277368) (← links)
- Generalized P-systems with splicing and cutting/recombination (Q1592920) (← links)
- Sequential grammars with activation and blocking of rules (Q1647313) (← links)
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata (Q1650340) (← links)
- Chocolate \(\mathrm{P}\) automata (Q1709884) (← links)
- Hierarchical P systems with randomized right-hand sides of rules (Q1749153) (← links)
- Sequential and maximally parallel multiset rewriting: reversibility and determinism (Q1761715) (← links)
- P systems with local graph productions (Q1762940) (← links)
- Tissue P systems with channel states (Q1763703) (← links)
- Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714) (← links)
- P systems with activation and blocking of rules (Q1799353) (← links)
- Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\) (Q1874414) (← links)
- From regulated rewriting to computing with membranes: collapsing hierarchies (Q1884943) (← links)
- A formal framework for spiking neural P systems (Q1982991) (← links)
- P systems with limited number of objects (Q1982995) (← links)
- Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors (Q2003446) (← links)
- Prescribed teams of rules working on several objects (Q2104130) (← links)
- Variants of derivation modes for which purely catalytic P systems are computationally complete (Q2139058) (← links)
- When catalytic P systems with one catalyst can be computationally complete (Q2152296) (← links)
- Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete (Q2152303) (← links)
- Time-freeness and clock-freeness and related concepts in P systems (Q2285665) (← links)
- P systems with randomized right-hand sides of rules (Q2285666) (← links)
- Tissue P systems with point mutation rules (Q2328318) (← links)
- Contextual array grammars with matrix control, regular control languages, and tissue P systems control (Q2358676) (← links)
- Computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors (Q2400997) (← links)
- Self-stabilization in membrane systems (Q2515840) (← links)
- \(P\) systems with active membranes and without polarizations (Q2576608) (← links)
- (Q2708978) (← links)
- Polarizationless P Systems with One Active Membrane (Q2789118) (← links)
- Bridging Deterministic P Systems and Conditional Grammars (Q2789119) (← links)
- P Systems with Generalized Multisets Over Totally Ordered Abelian Groups (Q2789124) (← links)
- On the Power of Catalytic P Systems with One Catalyst (Q2789125) (← links)
- The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems (Q2800417) (← links)
- Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness (Q2805398) (← links)
- Variants of Small Universal P Systems with Catalysts (Q2805457) (← links)
- Contextual Array Grammars with Matrix and Regular Control (Q2829974) (← links)
- A formalization of membrane systems with dynamically evolving structures (Q2852133) (← links)
- Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings (Q2864200) (← links)
- Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete (Q2945525) (← links)
- Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages (Q2945564) (← links)