Zsolt Gazdag

Orcid: 0000-0002-5617-8743

According to our database1, Zsolt Gazdag authored at least 23 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited.
Int. J. Found. Comput. Sci., June, 2023

On the power of membrane dissolution in polarizationless P systems with active membranes.
Nat. Comput., March, 2023

A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules.
Theor. Comput. Sci., 2023

2021
On the power of P systems with active membranes using weak non-elementary membrane division.
J. Membr. Comput., 2021

2020
On the number of useful objects in P systems with active membranes.
CoRR, 2020

2019
A new method to simulate restricted variants of polarizationless P systems with active membranes.
J. Membr. Comput., 2019

A Pumping Lemma for Permitting Semi-Conditional Languages.
Int. J. Found. Comput. Sci., 2019

2018
Weighted Languages Recognizable by Weighted Tree Automata.
Acta Cybern., 2018

2017
On the Power of Permitting Semi-conditional Grammars.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016
Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

2014
Remarks on some Simple Variants of Random Context Grammars.
J. Autom. Lang. Comb., 2014

Simulating Turing Machines with Polarizationless P Systems with Active Membranes.
Proceedings of the Membrane Computing, 2014

Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques.
Proceedings of the Membrane Computing, 2014

2013
Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables.
Proceedings of the Membrane Computing, 2013

2012
A New Approach for Solving SAT by P Systems with Active Membranes.
Proceedings of the Membrane Computing, 2012

2011
A Kleene Theorem for Bisemigroup and binoid Languages.
Int. J. Found. Comput. Sci., 2011

2009
Improved upper bounds on synchronizing nondeterministic automata.
Inf. Process. Lett., 2009

2008
A Kleene Theorem for Binoid Languages.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

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

2005
Shape Preserving Bottom-Up Tree Transducers.
J. Autom. Lang. Comb., 2005

Bounds for Tree Automata with Polynomial Costs.
J. Autom. Lang. Comb., 2005

2004
Hierarchies of tree series transformations.
Theor. Comput. Sci., 2004

2003
Shape preserving top-down tree transducers.
Theor. Comput. Sci., 2003


  Loading...