Zoltán Fülöp

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 31

Top Topics

Top Venues

Int. J. Found. Comput. Sci.

Publications

Zoltán Fülöp, Heiko Vogler
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Zoltán Fülöp, George Rahonis, Kai Salomaa
Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Manfred Droste, Zoltán Fülöp, Andreja Tepavcevic, Heiko Vogler
The generating power of weighted tree automata with initial algebra semantics. CoRR (2024)
Frederic Dörband, Zoltán Fülöp, Heiko Vogler
Rational weighted tree languages with storage. Inf. Comput. 301 (2024)
Manfred Droste, Zoltán Fülöp, Dávid Kószó
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata. Int. J. Found. Comput. Sci. 34 (6) (2023)
Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. Theor. Comput. Sci. 919 (2022)
Zoltán Fülöp, Heiko Vogler
Principal abstract families of weighted tree languages. Inf. Comput. 282 (2022)
Zoltán Fülöp, Heiko Vogler
Weighted Tree Automata - May it be a little more? CoRR (2022)
Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Crisp-determinization of weighted tree automata over strong bimonoids. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. CoRR (2021)
Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. DCFS (2020)
Zoltán Fülöp, Heiko Vogler
Weighted iterated linear control. Acta Informatica 56 (5) (2019)
Zoltán Fülöp, Heiko Vogler
Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. CAI (2019)
Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Crisp-determinization of weighted tree automata over strong bimonoids. CoRR (2019)
Doreen Götze, Zoltán Fülöp, Manfred Droste
A Kleene theorem for weighted tree automata over tree valuation monoids. Inf. Comput. 269 (2019)
Zoltán Fülöp, Andreas Maletti
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. CIAA (2019)
Zoltán Fülöp, Heiko Vogler
Characterizations of recognizable weighted tree languages by logic and bimorphisms. Soft Comput. 22 (4) (2018)
Zoltán Fülöp, Zsolt Gazdag
Weighted Languages Recognizable by Weighted Tree Automata. Acta Cybern. 23 (3) (2018)
Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
Weighted Regular Tree Grammars with Storage. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Zoltán Fülöp, Sándor Vágvölgyi
Minimization of Deterministic Top-down Tree Automata. Acta Cybern. 23 (1) (2017)
Zoltán Fülöp
Preface. Acta Cybern. 23 (1) (2017)
Zoltán Fülöp
In Memoriam Zoltán Ésik. Acta Cybern. 23 (1) (2017)
Zoltán Fülöp
In Memoriam Zoltán Ésik (1951-2016). Int. J. Found. Comput. Sci. 28 (5) (2017)
Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
Weighted Regular Tree Grammars with Storage. CoRR (2017)
Joost Engelfriet, Zoltán Fülöp, Andreas Maletti
Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. 60 (2) (2017)
Zoltán Fülöp, Andreas Maletti
Linking theorems for tree transducers. J. Comput. Syst. Sci. 82 (7) (2016)
Zoltán Fülöp
Weighted tree automata and their characterization by logic - a summary. NCMA (2016)
Manfred Droste, Zoltán Fülöp, Doreen Götze
A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids. LATA (2016)
Zoltán Fülöp
Local Weighted Tree Languages. Acta Cybern. 22 (2) (2015)
Zoltán Ésik, Zoltán Fülöp
In Memory of Professor Ferenc Gécseg. Acta Cybern. 22 (2) (2015)
Zoltán Fülöp, Heiko Vogler
Characterizing weighted MSO for trees by branching transitive closure logics. Theor. Comput. Sci. 594 (2015)
Zoltán Fülöp, Heiko Vogler
Forward and backward application of symbolic tree transducers. Acta Informatica 51 (5) (2014)
Zoltán Fülöp, Andreas Maletti
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. Developments in Language Theory (2013)
Zoltán Fülöp, Andreas Maletti
Composition Closure of Linear Extended Top-down Tree Transducers CoRR (2013)
Zoltán Fülöp, Heiko Vogler
Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics CoRR (2012)
Zoltán Fülöp, Torsten Stüber, Heiko Vogler
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. Theory Comput. Syst. 50 (2) (2012)
Zoltán Fülöp, Heiko Vogler
Forward and Backward Application of Symbolic Tree Transducers CoRR (2012)
Symeon Bozapalidis, Zoltán Fülöp, George Rahonis
Equational weighted tree transformations. Acta Informatica 49 (1) (2012)
Symeon Bozapalidis, Zoltán Fülöp, George Rahonis
Equational tree transformations. Theor. Comput. Sci. 412 (29) (2011)
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
Weighted Extended Tree Transducers. Fundam. Informaticae 111 (2) (2011)
Zoltán Fülöp, George Rahonis
Equational Weighted Tree Transformations with Discounting. Algebraic Foundations in Computer Science (2011)
Zoltán Fülöp, Magnus Steinby
Varieties of recognizable tree series over fields. Theor. Comput. Sci. 412 (8-10) (2011)
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
Preservation of Recognizability for Synchronous Tree Substitution Grammars. ATANLP@ACL 2010 (2010)
Torsten Stüber, Heiko Vogler, Zoltán Fülöp
Decomposition of Weighted multioperator Tree Automata. Int. J. Found. Comput. Sci. 20 (2) (2009)
Zoltán Fülöp, Magnus Steinby
Formal Series of General Algebras over a Field and Their Syntactic Algebras. Automata, Formal Languages, and Related Topics (2009)
Zoltán Fülöp, Lorand Muzamel
Weighted Tree-Walking Automata. Acta Cybern. 19 (2) (2009)
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Theory Comput. Syst. 44 (3) (2009)
Zoltán Fülöp, Lorand Muzamel
Pebble Macro Tree Transducers with Strong Pebble Handling. Fundam. Informaticae 89 (2-3) (2008)
Zoltán Fülöp, Lorand Muzamel
Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers. J. Autom. Lang. Comb. 13 (1) (2008)
Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti
Bounds for Tree Automata with Polynomial Costs. J. Autom. Lang. Comb. 10 (2/3) (2005)
Zoltán Fülöp, Armin Kühnemann, Heiko Vogler
Linear deterministic multi bottom-up tree transducers. Theor. Comput. Sci. 347 (1-2) (2005)
Zoltán Fülöp, Heiko Vogler
Weighted Tree Transducers. J. Autom. Lang. Comb. 9 (1) (2004)
Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler
Hierarchies of tree series transformations. Theor. Comput. Sci. 314 (3) (2004)
Zoltán Fülöp, Armin Kühnemann, Heiko Vogler
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett. 91 (2) (2004)
Zoltán Ésik, Zoltán Fülöp
Foreword. Theor. Comput. Sci. 327 (3) (2004)
Zoltán Fülöp, Heiko Vogler
Tree Series Transformations that Respect Copying. Theory Comput. Syst. 36 (3) (2003)
Zoltán Fülöp, Zsolt Gazdag
Shape preserving top-down tree transducers. Theor. Comput. Sci. 304 (1-3) (2003)
Zoltán Fülöp, Alain Terlutte
Iterated relabeling tree transducers. Theor. Comput. Sci. 276 (1-2) (2002)
Joost Engelfriet, Zoltán Fülöp, Heiko Vogler
Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. 7 (1) (2002)
G. Dányi, Zoltán Fülöp
The component hierarchy of chain-free cooperating distributed regular tree grammars. Theor. Comput. Sci. 262 (1) (2001)
Zoltán Fülöp
Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers. J. Autom. Lang. Comb. 6 (2) (2001)
Zoltán Fülöp, Sándor Vágvölgyi
Restricted ground tree transducers. Theor. Comput. Sci. 250 (1-2) (2001)
Zoltán Fülöp, Sebastian Maneth
Domains of partial attributed tree transducers. Inf. Process. Lett. 73 (5-6) (2000)
Zoltán Fülöp, Sebastian Maneth
A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars. Grammatical Models of Multi-Agent Systems (1999)
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
On One-Pass Term Rewriting. Acta Cybern. 14 (1) (1999)
Zoltán Fülöp, Heiko Vogler
A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. Theory Comput. Syst. 32 (6) (1999)
Zoltán Fülöp
Distributed Tree Processing Devices. Comput. Artif. Intell. 18 (1) (1999)
Tibor Csendes, Zoltán Fülöp
Preface - Papers from the Conference for PhD Students in Computer Science. Acta Cybern. 14 (2) (1999)
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
On One-Pass Term Rewriting. MFCS (1998)
G. Dányi, Zoltán Fülöp
Compositions with Superlinear Deterministic Top-Down Tree Transformations. Theor. Comput. Sci. 194 (1-2) (1998)
Zoltán Fülöp, Sándor Vágvölgyi
Minimal Equational Representations of Recognizable Tree Languages. Acta Informatica 34 (1) (1997)
G. Dányi, Zoltán Fülöp
A Note on the Equivalence Problem of E-Patterns. Inf. Process. Lett. 57 (3) (1996)
G. Dányi, Zoltán Fülöp
Superlinear Deterministic Top-Down Tree Transducers. Math. Syst. Theory 29 (5) (1996)
Zoltán Fülöp, Sándor Vágvölgyi
Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations Inf. Comput. 116 (2) (1995)
Zoltán Fülöp
Undecidable Properties of Deterministic Top-Down Tree Transducers. Theor. Comput. Sci. 134 (2) (1994)
Zoltán Fülöp, Pál Gyenizse
On Injectivity of Deterministic Top-Down Tree Transducers. Inf. Process. Lett. 48 (4) (1993)
Zoltán Fülöp, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler
Tree Transducers with External Functions. Theor. Comput. Sci. 108 (2) (1993)
Zoltán Fülöp, Sándor Vágvölgyi
A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. Theor. Comput. Sci. 81 (1) (1991)
Zoltán Fülöp, Sándor Vágvölgyi
Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. Bull. EATCS 45 (1991)
Zoltán Fülöp
A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes. Theor. Comput. Sci. 88 (2) (1991)
Zoltán Fülöp, Sándor Vágvölgyi
The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. Inf. Process. Lett. 36 (6) (1990)
Zoltán Fülöp, Sándor Vágvölgyi
A Complete Rewriting System for a Monoid of Tree Transformation Classes Inf. Comput. 86 (2) (1990)
Zoltán Fülöp, Sándor Vágvölgyi
Iterated Deterministic Top-Down Look-Ahead. FCT (1989)
Zoltán Fülöp, Sándor Vágvölgyi
Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. Bull. EATCS 39 (1989)
Zoltán Fülöp, Sándor Vágvölgyi
Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. Inf. Process. Lett. 33 (1) (1989)
Zoltán Fülöp, Sándor Vágvölgyi
Variants of Top-Down Tree Transducers With Look-Ahead. Math. Syst. Theory 21 (3) (1989)
Zoltán Fülöp, Sándor Vágvölgyi
A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata. ALP (1988)
Zoltán Fülöp, Sándor Vágvölgyi
On domains of tree tranducers. Bull. EATCS 34 (1988)
Sándor Vágvölgyi, Zoltán Fülöp
On ranges of compositions of deterministic root-to-frontier tree transformations. Acta Cybern. 8 (3) (1988)
Sándor Vágvölgyi, Zoltán Fülöp
An infinite hierarchy of tree transformations in the class NDR. Acta Cybern. 8 (2) (1987)
Zoltán Fülöp, Sándor Vágvölgyi
Results on compositions of deterministic root-to-frontier tree transformations. Acta Cybern. 8 (1) (1987)
Zoltán Fülöp
Decomposition results concerning K-visit attributed tree transducers. Acta Cybern. 6 (2) (1983)
Zoltán Fülöp
On attributed tree transducers. Acta Cybern. 5 (3) (1981)