Shape preserving top-down tree transducers. - Zoltán Fülöp 001; Zsolt Gazdag (Theor. Comput. Sci., 2003)

Hierarchies of tree series transformations. - Zoltán Fülöp 001; Zsolt Gazdag; Heiko Vogler (Theor. Comput. Sci., 2004)

Bounds for Tree Automata with Polynomial Costs. - Björn Borchardt; Zoltán Fülöp 001; Zsolt Gazdag; Andreas Maletti (J. Autom. Lang. Comb., 2005)

Shape Preserving Bottom-Up Tree Transducers. - Zsolt Gazdag (J. Autom. Lang. Comb., 2005)

Decidability of the Shape Preserving Property of Bottom-up Tree Transducers. - Zsolt Gazdag (Int. J. Found. Comput. Sci., 2006)

A Kleene Theorem for Binoid Languages. - Zsolt Gazdag; Zoltán L. Németh (AFL, 2008)

Improved upper bounds on synchronizing nondeterministic automata. - Zsolt Gazdag; Szabolcs Iván; Judit Nagy-György (Inf. Process. Lett., 2009)

A Kleene Theorem for Bisemigroup and binoid Languages. - Zsolt Gazdag; Zoltán L. Németh (Int. J. Found. Comput. Sci., 2011)

A New Approach for Solving SAT by P Systems with Active Membranes. - Zsolt Gazdag; Gábor Kolonits (Int. Conf. on Membrane Computing, 2012)

Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables. - Zsolt Gazdag (Int. Conf. on Membrane Computing, 2013)

Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques. - Zsolt Gazdag; Miguel A. Gutiérrez-Naranjo (Int. Conf. on Membrane Computing, 2014)

Simulating Turing Machines with Polarizationless P Systems with Active Membranes. - Zsolt Gazdag; Gábor Kolonits; Miguel A. Gutiérrez-Naranjo (Int. Conf. on Membrane Computing, 2014)

Remarks on some Simple Variants of Random Context Grammars. - Zsolt Gazdag (J. Autom. Lang. Comb., 2014)

Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes. - Zsolt Gazdag; Gábor Kolonits (Int. Conf. on Membrane Computing, 2016)

On the Power of Permitting Semi-conditional Grammars. - Zsolt Gazdag; Krisztián Tichler (DLT, 2017)

Weighted Languages Recognizable by Weighted Tree Automata. - Zoltán Fülöp 001; Zsolt Gazdag (Acta Cybern., 2018)

A Pumping Lemma for Permitting Semi-Conditional Languages. - Zsolt Gazdag; Krisztián Tichler; Erzsébet Csuhaj-Varjú (Int. J. Found. Comput. Sci., 2019)

A new method to simulate restricted variants of polarizationless P systems with active membranes. - Zsolt Gazdag; Gábor Kolonits (J. Membr. Comput., 2019)

On the number of useful objects in P systems with active membranes. - Zsolt Gazdag; Károly Hajagos; Szabolcs Iván (CoRR, 2020)

On the power of P systems with active membranes using weak non-elementary membrane division. - Zsolt Gazdag; Károly Hajagos; Szabolcs Iván (J. Membr. Comput., 2021)

A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules. - Zsolt Gazdag; Károly Hajagos (Theor. Comput. Sci., 2023)

On the power of membrane dissolution in polarizationless P systems with active membranes. - Zsolt Gazdag; Károly Hajagos (Nat. Comput., 2023)

The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited. - Zsolt Gazdag; Sándor Vágvölgyi (Int. J. Found. Comput. Sci., 2023)