On attributed tree transducers. - Zoltán Fülöp 001 (Acta Cybern., 1981)

Decomposition results concerning K-visit attributed tree transducers. - Zoltán Fülöp 001 (Acta Cybern., 1983)

Results on compositions of deterministic root-to-frontier tree transformations. - Zoltán Fülöp 001; Sándor Vágvölgyi (Acta Cybern., 1987)

An infinite hierarchy of tree transformations in the class NDR. - Sándor Vágvölgyi; Zoltán Fülöp 001 (Acta Cybern., 1987)

A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata. - Zoltán Fülöp 001; Sándor Vágvölgyi (ALP, 1988)

On ranges of compositions of deterministic root-to-frontier tree transformations. - Sándor Vágvölgyi; Zoltán Fülöp 001 (Acta Cybern., 1988)

On domains of tree tranducers. - Zoltán Fülöp 001; Sándor Vágvölgyi (Bull. EATCS, 1988)

Iterated Deterministic Top-Down Look-Ahead. - Zoltán Fülöp 001; Sándor Vágvölgyi (FCT, 1989)

Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. - Zoltán Fülöp 001; Sándor Vágvölgyi (Bull. EATCS, 1989)

Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. - Zoltán Fülöp 001; Sándor Vágvölgyi (Inf. Process. Lett., 1989)

Variants of Top-Down Tree Transducers With Look-Ahead. - Zoltán Fülöp 001; Sándor Vágvölgyi (Math. Syst. Theory, 1989)

The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. - Zoltán Fülöp 001; Sándor Vágvölgyi (Inf. Process. Lett., 1990)

A Complete Rewriting System for a Monoid of Tree Transformation Classes - Zoltán Fülöp 001; Sándor Vágvölgyi (Inf. Comput., 1990)

Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. - Zoltán Fülöp 001; Sándor Vágvölgyi (Bull. EATCS, 1991)

A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes. - Zoltán Fülöp 001 (Theor. Comput. Sci., 1991)

A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. - Zoltán Fülöp 001; Sándor Vágvölgyi (Theor. Comput. Sci., 1991)

Decidability of the inclusion in monoids generated by tree transformation classes. - Zoltán Fülöp 001; Sándor Vágvölgyi (Tree Automata and Languages, 1992)

On Injectivity of Deterministic Top-Down Tree Transducers. - Zoltán Fülöp 001; Pál Gyenizse (Inf. Process. Lett., 1993)

Tree Transducers with External Functions. - Zoltán Fülöp 001; Frank Herrmann; Sándor Vágvölgyi; Heiko Vogler (Theor. Comput. Sci., 1993)

Undecidable Properties of Deterministic Top-Down Tree Transducers. - Zoltán Fülöp 001 (Theor. Comput. Sci., 1994)

Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations - Zoltán Fülöp 001; Sándor Vágvölgyi (Inf. Comput., 1995)

A Note on the Equivalence Problem of E-Patterns. - G. Dányi; Zoltán Fülöp 001 (Inf. Process. Lett., 1996)

Superlinear Deterministic Top-Down Tree Transducers. - G. Dányi; Zoltán Fülöp 001 (Math. Syst. Theory, 1996)

Minimal Equational Representations of Recognizable Tree Languages. - Zoltán Fülöp 001; Sándor Vágvölgyi (Acta Informatica, 1997)

Compositions with Superlinear Deterministic Top-Down Tree Transformations. - G. Dányi; Zoltán Fülöp 001 (Theor. Comput. Sci., 1998)

Syntax-Directed Semantics - Formal Models Based on Tree Transducers - Zoltán Fülöp 001; Heiko Vogler (Springer, 1998)

A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars. - Zoltán Fülöp 001; Sebastian Maneth (Grammatical Models of Multi-Agent Systems, 1999)

Preface - Papers from the Conference for PhD Students in Computer Science. - Tibor Csendes; Zoltán Fülöp 001 (Acta Cybern., 1999)

On One-Pass Term Rewriting. - Zoltán Fülöp 001; Eija Jurvanen; Magnus Steinby; Sándor Vágvölgyi (Acta Cybern., 1999)

Distributed Tree Processing Devices. - Zoltán Fülöp 001 (Comput. Artif. Intell., 1999)

A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. - Zoltán Fülöp 001; Heiko Vogler (Theory Comput. Syst., 1999)

Domains of partial attributed tree transducers. - Zoltán Fülöp 001; Sebastian Maneth (Inf. Process. Lett., 2000)

Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers. - Zoltán Fülöp 001 (J. Autom. Lang. Comb., 2001)

The component hierarchy of chain-free cooperating distributed regular tree grammars. - G. Dányi; Zoltán Fülöp 001 (Theor. Comput. Sci., 2001)

Restricted ground tree transducers. - Zoltán Fülöp 001; Sándor Vágvölgyi (Theor. Comput. Sci., 2001)

Bottom-Up and Top-Down Tree Series Transformations. - Joost Engelfriet; Zoltán Fülöp 001; Heiko Vogler (J. Autom. Lang. Comb., 2002)

Iterated relabeling tree transducers. - Zoltán Fülöp 001; Alain Terlutte (Theor. Comput. Sci., 2002)

Tree Series Transformations that Respect Copying. - Zoltán Fülöp 001; Heiko Vogler (Theory Comput. Syst., 2003)

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

A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. - Zoltán Fülöp 001; Armin Kühnemann; Heiko Vogler (Inf. Process. Lett., 2004)

Weighted Tree Transducers. - Zoltán Fülöp 001; Heiko Vogler (J. Autom. Lang. Comb., 2004)

Foreword. - Zoltán Ésik; Zoltán Fülöp 001 (Theor. Comput. Sci., 2004)

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)

Linear deterministic multi bottom-up tree transducers. - Zoltán Fülöp 001; Armin Kühnemann; Heiko Vogler (Theor. Comput. Sci., 2005)

Pebble Macro Tree Transducers with Strong Pebble Handling. - Zoltán Fülöp 001; Lorand Muzamel (Fundam. Informaticae, 2008)

Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers. - Zoltán Fülöp 001; Lorand Muzamel (J. Autom. Lang. Comb., 2008)

Formal Series of General Algebras over a Field and Their Syntactic Algebras. - Zoltán Fülöp 001; Magnus Steinby (Automata, Formal Languages, and Related Topics, 2009)

Weighted Tree-Walking Automata. - Zoltán Fülöp 001; Lorand Muzamel (Acta Cybern., 2009)

Decomposition of Weighted multioperator Tree Automata. - Torsten Stüber; Heiko Vogler; Zoltán Fülöp 001 (Int. J. Found. Comput. Sci., 2009)

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (Theory Comput. Syst., 2009)

Preservation of Recognizability for Synchronous Tree Substitution Grammars. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (ATANLP@ACL 2010, 2010)

Equational Weighted Tree Transformations with Discounting. - Zoltán Fülöp 001; George Rahonis (Algebraic Foundations in Computer Science, 2011)

Weighted Extended Tree Transducers. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (Fundam. Informaticae, 2011)

Equational tree transformations. - Symeon Bozapalidis; Zoltán Fülöp 001; George Rahonis (Theor. Comput. Sci., 2011)

Varieties of recognizable tree series over fields. - Zoltán Fülöp 001; Magnus Steinby (Theor. Comput. Sci., 2011)

Equational weighted tree transformations. - Symeon Bozapalidis; Zoltán Fülöp 001; George Rahonis (Acta Informatica, 2012)

A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. - Zoltán Fülöp 001; Torsten Stüber; Heiko Vogler (Theory Comput. Syst., 2012)

Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. - Zoltán Fülöp 001; Andreas Maletti (Developments in Language Theory, 2013)

Composition Closure of Linear Extended Top-down Tree Transducers - Zoltán Fülöp 001; Andreas Maletti (CoRR, 2013)

Forward and backward application of symbolic tree transducers. - Zoltán Fülöp 001; Heiko Vogler (Acta Informatica, 2014)

Local Weighted Tree Languages. - Zoltán Fülöp 001 (Acta Cybern., 2015)

In Memory of Professor Ferenc Gécseg. - Zoltán Ésik; Zoltán Fülöp 001 (Acta Cybern., 2015)

Characterizing weighted MSO for trees by branching transitive closure logics. - Zoltán Fülöp 001; Heiko Vogler (Theor. Comput. Sci., 2015)

Weighted tree automata and their characterization by logic - a summary. - Zoltán Fülöp 001 (NCMA, 2016)

Linking theorems for tree transducers. - Zoltán Fülöp 001; Andreas Maletti (J. Comput. Syst. Sci., 2016)

Preface. - Zoltán Fülöp 001 (Acta Cybern., 2017)

In Memoriam Zoltán Ésik. - Zoltán Fülöp 001 (Acta Cybern., 2017)

Minimization of Deterministic Top-down Tree Automata. - Zoltán Fülöp 001; Sándor Vágvölgyi (Acta Cybern., 2017)

In Memoriam Zoltán Ésik (1951-2016). - Zoltán Fülöp 001 (Int. J. Found. Comput. Sci., 2017)

Composition Closure of Linear Extended Top-down Tree Transducers. - Joost Engelfriet; Zoltán Fülöp 001; Andreas Maletti (Theory Comput. Syst., 2017)

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

Weighted Regular Tree Grammars with Storage. - Zoltán Fülöp 001; Luisa Herrmann 001; Heiko Vogler (Discret. Math. Theor. Comput. Sci., 2018)

Characterizations of recognizable weighted tree languages by logic and bimorphisms. - Zoltán Fülöp 001; Heiko Vogler (Soft Comput., 2018)

Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. - Zoltán Fülöp 001; Heiko Vogler (CAI, 2019)

Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. - Zoltán Fülöp 001; Andreas Maletti (CIAA, 2019)

Weighted iterated linear control. - Zoltán Fülöp 001; Heiko Vogler (Acta Informatica, 2019)

A Kleene theorem for weighted tree automata over tree valuation monoids. - Doreen Götze; Zoltán Fülöp 001; Manfred Droste (Inf. Comput., 2019)

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (DCFS, 2020)

Crisp-determinization of weighted tree automata over strong bimonoids. - Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (Discret. Math. Theor. Comput. Sci., 2021)

Weighted Tree Automata - May it be a little more? - Zoltán Fülöp 001; Heiko Vogler (CoRR, 2022)

Principal abstract families of weighted tree languages. - Zoltán Fülöp 001; Heiko Vogler (Inf. Comput., 2022)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (Theor. Comput. Sci., 2022)

Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó (Int. J. Found. Comput. Sci., 2023)

The generating power of weighted tree automata with initial algebra semantics. - Manfred Droste; Zoltán Fülöp 001; Andreja Tepavcevic; Heiko Vogler (CoRR, 2024)

Rational weighted tree languages with storage. - Frederic Dörband; Zoltán Fülöp 001; Heiko Vogler (Inf. Comput., 2024)

Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. - Zoltán Fülöp 001; George Rahonis; Kai Salomaa (Int. J. Found. Comput. Sci., 2024)

A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. - Zoltán Fülöp 001; Heiko Vogler (Int. J. Found. Comput. Sci., 2024)