Zsolt Gazdag

25 papers C 1Journal 17Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
On accepting conditions in P systems with active membranes.
J. Membr. Comput.
Zsolt Gazdag, Károly Hajagos
2023 J jnl
A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules.
Theor. Comput. Sci.
Zsolt Gazdag, Károly Hajagos
2023 J jnl
On the power of membrane dissolution in polarizationless P systems with active membranes.
Nat. Comput.
Zsolt Gazdag, Károly Hajagos
2023 — ed.
Proceedings of the 16th International Conference on Automata and Formal Languages, AFL 2023, Eger, Hungary, September 5-7, 2023.
AFL
Zsolt Gazdag, Szabolcs Iván, Gergely Kovásznai
2023 J jnl
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited.
Int. J. Found. Comput. Sci.
Zsolt Gazdag, Sándor Vágvölgyi
2021 J jnl
On the power of P systems with active membranes using weak non-elementary membrane division.
J. Membr. Comput.
Zsolt Gazdag, Károly Hajagos, Szabolcs Iván
2020 J jnl
On the number of useful objects in P systems with active membranes.
CoRR
Zsolt Gazdag, Károly Hajagos, Szabolcs Iván
2019 J jnl
A Pumping Lemma for Permitting Semi-Conditional Languages.
Int. J. Found. Comput. Sci.
Zsolt Gazdag, Krisztián Tichler, Erzsébet Csuhaj-Varjú
2019 J jnl
A new method to simulate restricted variants of polarizationless P systems with active membranes.
J. Membr. Comput.
Zsolt Gazdag, Gábor Kolonits
2018 J jnl
Weighted Languages Recognizable by Weighted Tree Automata.
Acta Cybern.
Zoltán Fülöp, Zsolt Gazdag
2017 C conf
On the Power of Permitting Semi-conditional Grammars.
DLT
Zsolt Gazdag, Krisztián Tichler
2016 — conf
Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes.
Int. Conf. on Membrane Computing
Zsolt Gazdag, Gábor Kolonits
2014 J jnl
Remarks on some Simple Variants of Random Context Grammars.
J. Autom. Lang. Comb.
Zsolt Gazdag
2014 — conf
Simulating Turing Machines with Polarizationless P Systems with Active Membranes.
Int. Conf. on Membrane Computing
Zsolt Gazdag, Gábor Kolonits, Miguel A. Gutiérrez-Naranjo
2014 — conf
Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques.
Int. Conf. on Membrane Computing
Zsolt Gazdag, Miguel A. Gutiérrez-Naranjo
2013 — conf
Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables.
Int. Conf. on Membrane Computing
Zsolt Gazdag
2012 — conf
A New Approach for Solving SAT by P Systems with Active Membranes.
Int. Conf. on Membrane Computing
Zsolt Gazdag, Gábor Kolonits
2011 J jnl
A Kleene Theorem for Bisemigroup and binoid Languages.
Int. J. Found. Comput. Sci.
Zsolt Gazdag, Zoltán L. Németh
2009 J jnl
Improved upper bounds on synchronizing nondeterministic automata.
Inf. Process. Lett.
Zsolt Gazdag, Szabolcs Iván, Judit Nagy-György
2008 — conf
A Kleene Theorem for Binoid Languages.
AFL
Zsolt Gazdag, Zoltán L. Németh
2006 J jnl
Decidability of the Shape Preserving Property of Bottom-up Tree Transducers.
Int. J. Found. Comput. Sci.
Zsolt Gazdag
2005 J jnl
Bounds for Tree Automata with Polynomial Costs.
J. Autom. Lang. Comb.
Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti
2005 J jnl
Shape Preserving Bottom-Up Tree Transducers.
J. Autom. Lang. Comb.
Zsolt Gazdag
2004 J jnl
Hierarchies of tree series transformations.
Theor. Comput. Sci.
Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler
2003 J jnl
Shape preserving top-down tree transducers.
Theor. Comput. Sci.
Zoltán Fülöp, Zsolt Gazdag