The following pages link to Zsolt Gazdag (Q989548):
Displaying 21 items.
- Improved upper bounds on synchronizing nondeterministic automata (Q989550) (← links)
- Shape preserving top-down tree transducers. (Q1401405) (← links)
- Hierarchies of tree series transformations (Q1826640) (← links)
- A new method to simulate restricted variants of polarizationless P systems with active membranes (Q1983030) (← links)
- On the power of P systems with active membranes using weak non-elementary membrane division (Q2152305) (← links)
- On the power of permitting semi-conditional grammars (Q2408801) (← links)
- Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes (Q2975915) (← links)
- A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES (Q3086249) (← links)
- (Q3431475) (← links)
- Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques (Q3454891) (← links)
- Simulating Turing Machines with Polarizationless P Systems with Active Membranes (Q3454892) (← links)
- Weighted Languages Recognizable by Weighted Tree Automata (Q4584658) (← links)
- A New Approach for Solving SAT by P Systems with Active Membranes (Q4913840) (← links)
- DECIDABILITY OF THE SHAPE PRESERVING PROPERTY OF BOTTOM-UP TREE TRANSDUCERS (Q5291303) (← links)
- A Pumping Lemma for Permitting Semi-Conditional Languages (Q5384432) (← links)
- Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables (Q5404852) (← links)
- (Q5437184) (← links)
- (Q5507060) (← links)
- The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited (Q6132394) (← links)
- On the power of membrane dissolution in polarizationless P systems with active membranes (Q6136468) (← links)
- A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules (Q6162071) (← links)
