Zoltán Fülöp

101 papers A* 1B 2C 4Journal 82Unranked 8

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras. CoRR Zoltán Fülöp, Heiko Vogler
2025	J	`jnl`	Free polynomial strong bimonoids. CoRR Manfred Droste, Zoltán Fülöp
2024	J	`jnl`	A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. Int. J. Found. Comput. Sci. Zoltán Fülöp, Heiko Vogler
2024	J	`jnl`	Rational weighted tree languages with storage. Inf. Comput. Frederic Dörband, Zoltán Fülöp, Heiko Vogler
2024	J	`jnl`	Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. Int. J. Found. Comput. Sci. Zoltán Fülöp, George Rahonis, Kai Salomaa
2024	J	`jnl`	The generating power of weighted tree automata with initial algebra semantics. CoRR Manfred Droste, Zoltán Fülöp, Andreja Tepavcevic, Heiko Vogler
2023	J	`jnl`	Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata. Int. J. Found. Comput. Sci. Manfred Droste, Zoltán Fülöp, Dávid Kószó
2022	J	`jnl`	Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. Theor. Comput. Sci. Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
2022	J	`jnl`	Principal abstract families of weighted tree languages. Inf. Comput. Zoltán Fülöp, Heiko Vogler
2022	J	`jnl`	Weighted Tree Automata - May it be a little more? CoRR Zoltán Fülöp, Heiko Vogler
2021	J	`jnl`	Crisp-determinization of weighted tree automata over strong bimonoids. Discret. Math. Theor. Comput. Sci. Zoltán Fülöp, Dávid Kószó, Heiko Vogler
2021	J	`jnl`	Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. CoRR Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
2020	—	`conf`	Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. DCFS Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
2019	J	`jnl`	A Kleene theorem for weighted tree automata over tree valuation monoids. Inf. Comput. Doreen Götze, Zoltán Fülöp, Manfred Droste
2019	C	`conf`	Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. CIAA Zoltán Fülöp, Andreas Maletti
2019	J	`jnl`	Crisp-determinization of weighted tree automata over strong bimonoids. CoRR Zoltán Fülöp, Dávid Kószó, Heiko Vogler
2019	—	`conf`	Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. CAI Zoltán Fülöp, Heiko Vogler
2019	J	`jnl`	Weighted iterated linear control. Acta Informatica Zoltán Fülöp, Heiko Vogler
2018	J	`jnl`	Characterizations of recognizable weighted tree languages by logic and bimorphisms. Soft Comput. Zoltán Fülöp, Heiko Vogler
2018	J	`jnl`	Weighted Languages Recognizable by Weighted Tree Automata. Acta Cybern. Zoltán Fülöp, Zsolt Gazdag
2018	J	`jnl`	Weighted Regular Tree Grammars with Storage. Discret. Math. Theor. Comput. Sci. Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
2017	J	`jnl`	Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. Joost Engelfriet, Zoltán Fülöp, Andreas Maletti
2017	J	`jnl`	In Memoriam Zoltán Ésik (1951-2016). Int. J. Found. Comput. Sci. Zoltán Fülöp
2017	J	`jnl`	In Memoriam Zoltán Ésik. Acta Cybern. Zoltán Fülöp
2017	J	`jnl`	Minimization of Deterministic Top-down Tree Automata. Acta Cybern. Zoltán Fülöp, Sándor Vágvölgyi
2017	J	`jnl`	Preface. Acta Cybern. Zoltán Fülöp
2017	J	`jnl`	Weighted Regular Tree Grammars with Storage. CoRR Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
2016	C	`conf`	A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids. LATA Manfred Droste, Zoltán Fülöp, Doreen Götze
2016	J	`jnl`	Linking theorems for tree transducers. J. Comput. Syst. Sci. Zoltán Fülöp, Andreas Maletti
2016	—	`conf`	Weighted tree automata and their characterization by logic - a summary. NCMA Zoltán Fülöp
2015	J	`jnl`	Characterizing weighted MSO for trees by branching transitive closure logics. Theor. Comput. Sci. Zoltán Fülöp, Heiko Vogler
2015	J	`jnl`	In Memory of Professor Ferenc Gécseg. Acta Cybern. Zoltán Ésik, Zoltán Fülöp
2015	J	`jnl`	Local Weighted Tree Languages. Acta Cybern. Zoltán Fülöp
2014	J	`jnl`	Forward and backward application of symbolic tree transducers. Acta Informatica Zoltán Fülöp, Heiko Vogler
2014	—	`ed.`	Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014. AFL Zoltán Ésik, Zoltán Fülöp
2013	J	`jnl`	Composition Closure of Linear Extended Top-down Tree Transducers CoRR Zoltán Fülöp, Andreas Maletti
2013	C	`conf`	Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. Developments in Language Theory Zoltán Fülöp, Andreas Maletti
2012	J	`jnl`	A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. Theory Comput. Syst. Zoltán Fülöp, Torsten Stüber, Heiko Vogler
2012	J	`jnl`	Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics CoRR Zoltán Fülöp, Heiko Vogler
2012	J	`jnl`	Equational weighted tree transformations. Acta Informatica Symeon Bozapalidis, Zoltán Fülöp, George Rahonis
2012	J	`jnl`	Forward and Backward Application of Symbolic Tree Transducers CoRR Zoltán Fülöp, Heiko Vogler
2011	—	`conf`	Equational Weighted Tree Transformations with Discounting. Algebraic Foundations in Computer Science Zoltán Fülöp, George Rahonis
2011	J	`jnl`	Equational tree transformations. Theor. Comput. Sci. Symeon Bozapalidis, Zoltán Fülöp, George Rahonis
2011	J	`jnl`	Varieties of recognizable tree series over fields. Theor. Comput. Sci. Zoltán Fülöp, Magnus Steinby
2011	J	`jnl`	Weighted Extended Tree Transducers. Fundam. Informaticae Zoltán Fülöp, Andreas Maletti, Heiko Vogler
2010	—	`conf`	Preservation of Recognizability for Synchronous Tree Substitution Grammars. ATANLP@ACL 2010 Zoltán Fülöp, Andreas Maletti, Heiko Vogler
2009	J	`jnl`	A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Theory Comput. Syst. Zoltán Fülöp, Andreas Maletti, Heiko Vogler
2009	—	`ed.`	Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthday Automata, Formal Languages, and Related Topics Zoltán Ésik, Zoltán Fülöp
2009	J	`jnl`	Decomposition of Weighted multioperator Tree Automata. Int. J. Found. Comput. Sci. Torsten Stüber, Heiko Vogler, Zoltán Fülöp
2009	—	`conf`	Formal Series of General Algebras over a Field and Their Syntactic Algebras. Automata, Formal Languages, and Related Topics Zoltán Fülöp, Magnus Steinby
2009	J	`jnl`	Weighted Tree-Walking Automata. Acta Cybern. Zoltán Fülöp, Lorand Muzamel
2008	J	`jnl`	Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers. J. Autom. Lang. Comb. Zoltán Fülöp, Lorand Muzamel
2008	J	`jnl`	Pebble Macro Tree Transducers with Strong Pebble Handling. Fundam. Informaticae Zoltán Fülöp, Lorand Muzamel
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`	Linear deterministic multi bottom-up tree transducers. Theor. Comput. Sci. Zoltán Fülöp, Armin Kühnemann, Heiko Vogler
2004	J	`jnl`	A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett. Zoltán Fülöp, Armin Kühnemann, Heiko Vogler
2004	J	`jnl`	Foreword. Theor. Comput. Sci. Zoltán Ésik, Zoltán Fülöp
2004	J	`jnl`	Hierarchies of tree series transformations. Theor. Comput. Sci. Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler
2004	J	`jnl`	Weighted Tree Transducers. J. Autom. Lang. Comb. Zoltán Fülöp, Heiko Vogler
2003	C	`ed.`	Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings Developments in Language Theory Zoltán Ésik, Zoltán Fülöp
2003	J	`jnl`	Shape preserving top-down tree transducers. Theor. Comput. Sci. Zoltán Fülöp, Zsolt Gazdag
2003	J	`jnl`	Tree Series Transformations that Respect Copying. Theory Comput. Syst. Zoltán Fülöp, Heiko Vogler
2002	J	`jnl`	Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. Joost Engelfriet, Zoltán Fülöp, Heiko Vogler
2002	J	`jnl`	Iterated relabeling tree transducers. Theor. Comput. Sci. Zoltán Fülöp, Alain Terlutte
2001	J	`jnl`	Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers. J. Autom. Lang. Comb. Zoltán Fülöp
2001	J	`jnl`	Restricted ground tree transducers. Theor. Comput. Sci. Zoltán Fülöp, Sándor Vágvölgyi
2001	J	`jnl`	The component hierarchy of chain-free cooperating distributed regular tree grammars. Theor. Comput. Sci. G. Dányi, Zoltán Fülöp
2000	J	`jnl`	Domains of partial attributed tree transducers. Inf. Process. Lett. Zoltán Fülöp, Sebastian Maneth
1999	J	`jnl`	A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. Theory Comput. Syst. Zoltán Fülöp, Heiko Vogler
1999	—	`conf`	A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars. Grammatical Models of Multi-Agent Systems Zoltán Fülöp, Sebastian Maneth
1999	J	`jnl`	Distributed Tree Processing Devices. Comput. Artif. Intell. Zoltán Fülöp
1999	J	`jnl`	On One-Pass Term Rewriting. Acta Cybern. Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
1999	J	`jnl`	Preface - Papers from the Conference for PhD Students in Computer Science. Acta Cybern. Tibor Csendes, Zoltán Fülöp
1998	J	`jnl`	Compositions with Superlinear Deterministic Top-Down Tree Transformations. Theor. Comput. Sci. G. Dányi, Zoltán Fülöp
1998	B	`conf`	On One-Pass Term Rewriting. MFCS Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
1998	—	`book`	Syntax-Directed Semantics - Formal Models Based on Tree Transducers Zoltán Fülöp, Heiko Vogler
1997	J	`jnl`	Minimal Equational Representations of Recognizable Tree Languages. Acta Informatica Zoltán Fülöp, Sándor Vágvölgyi
1996	J	`jnl`	A Note on the Equivalence Problem of E-Patterns. Inf. Process. Lett. G. Dányi, Zoltán Fülöp
1996	J	`jnl`	Superlinear Deterministic Top-Down Tree Transducers. Math. Syst. Theory G. Dányi, Zoltán Fülöp
1995	J	`jnl`	Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations Inf. Comput. Zoltán Fülöp, Sándor Vágvölgyi
1995	A*	`ed.`	Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings ICALP Zoltán Fülöp, Ferenc Gécseg
1994	J	`jnl`	Undecidable Properties of Deterministic Top-Down Tree Transducers. Theor. Comput. Sci. Zoltán Fülöp
1993	J	`jnl`	On Injectivity of Deterministic Top-Down Tree Transducers. Inf. Process. Lett. Zoltán Fülöp, Pál Gyenizse
1993	J	`jnl`	Tree Transducers with External Functions. Theor. Comput. Sci. Zoltán Fülöp, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler
1992	—	`ch.`	Decidability of the inclusion in monoids generated by tree transformation classes. Tree Automata and Languages Zoltán Fülöp, Sándor Vágvölgyi
1991	J	`jnl`	A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. Theor. Comput. Sci. Zoltán Fülöp, Sándor Vágvölgyi
1991	J	`jnl`	A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes. Theor. Comput. Sci. Zoltán Fülöp
1991	J	`jnl`	Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. Bull. EATCS Zoltán Fülöp, Sándor Vágvölgyi
1990	J	`jnl`	A Complete Rewriting System for a Monoid of Tree Transformation Classes Inf. Comput. Zoltán Fülöp, Sándor Vágvölgyi
1990	J	`jnl`	The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. Inf. Process. Lett. Zoltán Fülöp, Sándor Vágvölgyi
1989	J	`jnl`	Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. Bull. EATCS Zoltán Fülöp, Sándor Vágvölgyi
1989	B	`conf`	Iterated Deterministic Top-Down Look-Ahead. FCT Zoltán Fülöp, Sándor Vágvölgyi
1989	J	`jnl`	Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. Inf. Process. Lett. Zoltán Fülöp, Sándor Vágvölgyi
1989	J	`jnl`	Variants of Top-Down Tree Transducers With Look-Ahead. Math. Syst. Theory Zoltán Fülöp, Sándor Vágvölgyi
1988	—	`conf`	A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata. ALP Zoltán Fülöp, Sándor Vágvölgyi
1988	J	`jnl`	On domains of tree tranducers. Bull. EATCS Zoltán Fülöp, Sándor Vágvölgyi
1988	J	`jnl`	On ranges of compositions of deterministic root-to-frontier tree transformations. Acta Cybern. Sándor Vágvölgyi, Zoltán Fülöp
1987	J	`jnl`	An infinite hierarchy of tree transformations in the class NDR. Acta Cybern. Sándor Vágvölgyi, Zoltán Fülöp
1987	J	`jnl`	Results on compositions of deterministic root-to-frontier tree transformations. Acta Cybern. Zoltán Fülöp, Sándor Vágvölgyi
1983	J	`jnl`	Decomposition results concerning K-visit attributed tree transducers. Acta Cybern. Zoltán Fülöp
1981	J	`jnl`	On attributed tree transducers. Acta Cybern. Zoltán Fülöp