Zoltán Fülöp

According to our database, Zoltán Fülöp authored at least 86 papers between 1981 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices.

Zoltán Fülöp, Heiko Vogler

Int. J. Found. Comput. Sci., 2024

Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface.

Zoltán Fülöp, George Rahonis, Kai Salomaa

Int. J. Found. Comput. Sci., 2024

2023

Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata.

Manfred Droste, Zoltán Fülöp, Dávid Kószó

Int. J. Found. Comput. Sci., September, 2023

2022

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids.

Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler

Theor. Comput. Sci., 2022

Principal abstract families of weighted tree languages.

Zoltán Fülöp, Heiko Vogler

Inf. Comput., 2022

Weighted Tree Automata - May it be a little more?

Zoltán Fülöp, Heiko Vogler

CoRR, 2022

2021

Crisp-determinization of weighted tree automata over strong bimonoids.

Zoltán Fülöp, Dávid Kószó, Heiko Vogler

Discret. Math. Theor. Comput. Sci., 2021

2020

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, Dávid Kószó, Heiko Vogler

Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019

A Kleene theorem for weighted tree automata over tree valuation monoids.

Doreen Götze, Zoltán Fülöp, Manfred Droste

Inf. Comput., 2019

Weighted iterated linear control.

Zoltán Fülöp, Heiko Vogler

Acta Informatica, 2019

Composition Closure of Linear Weighted Extended Top-Down Tree Transducers.

Zoltán Fülöp, Andreas Maletti

Proceedings of the Implementation and Application of Automata, 2019

Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem.

Zoltán Fülöp, Heiko Vogler

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2018

Characterizations of recognizable weighted tree languages by logic and bimorphisms.

Zoltán Fülöp, Heiko Vogler

Soft Comput., 2018

Weighted Regular Tree Grammars with Storage.

Zoltán Fülöp, Luisa Herrmann, Heiko Vogler

Discret. Math. Theor. Comput. Sci., 2018

Weighted Languages Recognizable by Weighted Tree Automata.

Zoltán Fülöp, Zsolt Gazdag

Acta Cybern., 2018

2017

Composition Closure of Linear Extended Top-down Tree Transducers.

Joost Engelfriet, Zoltán Fülöp, Andreas Maletti

Theory Comput. Syst., 2017

In Memoriam Zoltán Ésik (1951-2016).

Zoltán Fülöp

Int. J. Found. Comput. Sci., 2017

Minimization of Deterministic Top-down Tree Automata.

Zoltán Fülöp, Sándor Vágvölgyi

Acta Cybern., 2017

In Memoriam Zoltán Ésik.

Zoltán Fülöp

Acta Cybern., 2017

Preface.

Zoltán Fülöp

Acta Cybern., 2017

2016

Linking theorems for tree transducers.

Zoltán Fülöp, Andreas Maletti

J. Comput. Syst. Sci., 2016

Weighted tree automata and their characterization by logic - a summary.

Zoltán Fülöp

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015

Characterizing weighted MSO for trees by branching transitive closure logics.

Zoltán Fülöp, Heiko Vogler

Theor. Comput. Sci., 2015

In Memory of Professor Ferenc Gécseg.

Zoltán Ésik, Zoltán Fülöp

Acta Cybern., 2015

Local Weighted Tree Languages.

Zoltán Fülöp

Acta Cybern., 2015

2014

Forward and backward application of symbolic tree transducers.

Zoltán Fülöp, Heiko Vogler

Acta Informatica, 2014

2013

Composition Closure of Linear Extended Top-down Tree Transducers

Zoltán Fülöp, Andreas Maletti

CoRR, 2013

Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers.

Zoltán Fülöp, Andreas Maletti

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids.

Zoltán Fülöp, Torsten Stüber, Heiko Vogler

Theory Comput. Syst., 2012

Equational weighted tree transformations.

Symeon Bozapalidis, Zoltán Fülöp, George Rahonis

Acta Informatica, 2012

2011

Varieties of recognizable tree series over fields.

Zoltán Fülöp, Magnus Steinby

Theor. Comput. Sci., 2011

Equational tree transformations.

Symeon Bozapalidis, Zoltán Fülöp, George Rahonis

Theor. Comput. Sci., 2011

Weighted Extended Tree Transducers.

Zoltán Fülöp, Andreas Maletti, Heiko Vogler

Fundam. Informaticae, 2011

Equational Weighted Tree Transformations with Discounting.

Zoltán Fülöp, George Rahonis

Proceedings of the Algebraic Foundations in Computer Science, 2011

2010

Preservation of Recognizability for Synchronous Tree Substitution Grammars.

Zoltán Fülöp, Andreas Maletti, Heiko Vogler

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

2009

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.

Zoltán Fülöp, Andreas Maletti, Heiko Vogler

Theory Comput. Syst., 2009

Decomposition of Weighted multioperator Tree Automata.

Torsten Stüber, Heiko Vogler, Zoltán Fülöp

Int. J. Found. Comput. Sci., 2009

Weighted Tree-Walking Automata.

Zoltán Fülöp, Lorand Muzamel

Acta Cybern., 2009

Formal Series of General Algebras over a Field and Their Syntactic Algebras.

Zoltán Fülöp, Magnus Steinby

Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008

Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers.

Zoltán Fülöp, Lorand Muzamel

J. Autom. Lang. Comb., 2008

Pebble Macro Tree Transducers with Strong Pebble Handling.

Zoltán Fülöp, Lorand Muzamel

Fundam. Informaticae, 2008

2005

Linear deterministic multi bottom-up tree transducers.

Zoltán Fülöp, Armin Kühnemann, Heiko Vogler

Theor. Comput. Sci., 2005

Bounds for Tree Automata with Polynomial Costs.

Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti

J. Autom. Lang. Comb., 2005

2004

Hierarchies of tree series transformations.

Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler

Theor. Comput. Sci., 2004

Foreword.

Zoltán Ésik, Zoltán Fülöp

Theor. Comput. Sci., 2004

Weighted Tree Transducers.

Zoltán Fülöp, Heiko Vogler

J. Autom. Lang. Comb., 2004

A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead.

Zoltán Fülöp, Armin Kühnemann, Heiko Vogler

Inf. Process. Lett., 2004

2003

Shape preserving top-down tree transducers.

Zoltán Fülöp, Zsolt Gazdag

Theor. Comput. Sci., 2003

Tree Series Transformations that Respect Copying.

Zoltán Fülöp, Heiko Vogler

Theory Comput. Syst., 2003

2002

Iterated relabeling tree transducers.

Zoltán Fülöp, Alain Terlutte

Theor. Comput. Sci., 2002

Bottom-Up and Top-Down Tree Series Transformations.

Joost Engelfriet, Zoltán Fülöp, Heiko Vogler

J. Autom. Lang. Comb., 2002

2001

Restricted ground tree transducers.

Zoltán Fülöp, Sándor Vágvölgyi

Theor. Comput. Sci., 2001

The component hierarchy of chain-free cooperating distributed regular tree grammars.

G. Dányi, Zoltán Fülöp

Theor. Comput. Sci., 2001

Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers.

Zoltán Fülöp

J. Autom. Lang. Comb., 2001

2000

Domains of partial attributed tree transducers.

Zoltán Fülöp, Sebastian Maneth

Inf. Process. Lett., 2000

1999

A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers.

Zoltán Fülöp, Heiko Vogler

Theory Comput. Syst., 1999

Distributed Tree Processing Devices.

Zoltán Fülöp

Comput. Artif. Intell., 1999

On One-Pass Term Rewriting.

Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi

Acta Cybern., 1999

Preface - Papers from the Conference for PhD Students in Computer Science.

Tibor Csendes, Zoltán Fülöp

Acta Cybern., 1999

A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars.

Zoltán Fülöp, Sebastian Maneth

Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

1998

Syntax-Directed Semantics - Formal Models Based on Tree Transducers

Zoltán Fülöp, Heiko Vogler

Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-72248-6, 1998

Compositions with Superlinear Deterministic Top-Down Tree Transformations.

G. Dányi, Zoltán Fülöp

Theor. Comput. Sci., 1998

1997

Minimal Equational Representations of Recognizable Tree Languages.

Zoltán Fülöp, Sándor Vágvölgyi

Acta Informatica, 1997

1996

Superlinear Deterministic Top-Down Tree Transducers.

G. Dányi, Zoltán Fülöp

Math. Syst. Theory, 1996

A Note on the Equivalence Problem of E-Patterns.

G. Dányi, Zoltán Fülöp

Inf. Process. Lett., 1996

1995

Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations

Zoltán Fülöp, Sándor Vágvölgyi

Inf. Comput., February, 1995

1994

Undecidable Properties of Deterministic Top-Down Tree Transducers.

Zoltán Fülöp

Theor. Comput. Sci., 1994

1993

Tree Transducers with External Functions.

Zoltán Fülöp, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler

Theor. Comput. Sci., 1993

On Injectivity of Deterministic Top-Down Tree Transducers.

Zoltán Fülöp, Pál Gyenizse

Inf. Process. Lett., 1993

1992

Decidability of the inclusion in monoids generated by tree transformation classes.

Zoltán Fülöp, Sándor Vágvölgyi

Proceedings of the Tree Automata and Languages., 1992

1991

A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes.

Zoltán Fülöp, Sándor Vágvölgyi

Theor. Comput. Sci., 1991

A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes.

Zoltán Fülöp

Theor. Comput. Sci., 1991

Ground Term Rewriting Rules for the Word Problem of Ground Term Equations.

Zoltán Fülöp, Sándor Vágvölgyi

Bull. EATCS, 1991

1990

A Complete Rewriting System for a Monoid of Tree Transformation Classes

Zoltán Fülöp, Sándor Vágvölgyi

Inf. Comput., June, 1990

The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations.

Zoltán Fülöp, Sándor Vágvölgyi

Inf. Process. Lett., 1990

1989

Variants of Top-Down Tree Transducers With Look-Ahead.

Zoltán Fülöp, Sándor Vágvölgyi

Math. Syst. Theory, 1989

Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead.

Zoltán Fülöp, Sándor Vágvölgyi

Inf. Process. Lett., 1989

Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen.

Zoltán Fülöp, Sándor Vágvölgyi

Bull. EATCS, 1989

Iterated Deterministic Top-Down Look-Ahead.

Zoltán Fülöp, Sándor Vágvölgyi

Proceedings of the Fundamentals of Computation Theory, 1989

1988

On domains of tree tranducers.

Zoltán Fülöp, Sándor Vágvölgyi

Bull. EATCS, 1988

On ranges of compositions of deterministic root-to-frontier tree transformations.

Sándor Vágvölgyi, Zoltán Fülöp

Acta Cybern., 1988

A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata.

Zoltán Fülöp, Sándor Vágvölgyi

Proceedings of the Algebraic and Logic Programming, 1988

1987

An infinite hierarchy of tree transformations in the class NDR.

Sándor Vágvölgyi, Zoltán Fülöp

Acta Cybern., 1987

Results on compositions of deterministic root-to-frontier tree transformations.

Zoltán Fülöp, Sándor Vágvölgyi

Acta Cybern., 1987

1983

Decomposition results concerning K-visit attributed tree transducers.

Zoltán Fülöp

Acta Cybern., 1983

1981

On attributed tree transducers.

Zoltán Fülöp

Acta Cybern., 1981