Zoltán Fülöp

发表

Bottom-Up and Top-Down Tree Series Transformations

Joost Engelfriet, Zoltán Fülöp, Heiko Vogler, 2001, J. Autom. Lang. Comb..

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

Zoltán Fülöp, Heiko Vogler, Armin Kühnemann, 2004, Inf. Process. Lett..

A Note on the Equivalence Problem of E-Patterns

Zoltán Fülöp, G. Dányi, 1996, Inf. Process. Lett..

Equational Weighted Tree Transformations with Discounting

Zoltán Fülöp, George Rahonis, Zoltán Fülöp, 2011, Algebraic Foundations in Computer Science.

Shape preserving top-down tree transducers

Zoltán Fülöp, Zsolt Gazdag, 2003, Theor. Comput. Sci..

Decomposition of Weighted multioperator Tree Automata

Zoltán Fülöp, Heiko Vogler, Torsten Stüber, 2009, Int. J. Found. Comput. Sci..

A Complete Rewriting System for a Monoid of Tree Transformation Classes

Sándor Vágvölgyi, Zoltán Fülöp, 1990, Inf. Comput..

Weighted iterated linear control

Zoltán Fülöp, Heiko Vogler, 2018, Acta Informatica.

Automata, languages and programming : 22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10-14, 1995 : proceedings

Zoltán Fülöp, Ferenc Gécseg, 1995 .

Restricted ground tree transducers

Sándor Vágvölgyi, Zoltán Fülöp, 2001, Theor. Comput. Sci..

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

Sándor Vágvölgyi, Zoltán Fülöp, 1995, Inf. Comput..

Top-Down Tree Transducers

Zoltán Fülöp, Heiko Vogler, 1998 .

Minimal equational representations of recognizable tree languages

Sándor Vágvölgyi, Zoltán Fülöp, 1997, Acta Informatica.

On Injectivity of Deterministic Top-Down Tree Transducers

Zoltán Fülöp, Pál Gyenizse, 1993, Inf. Process. Lett..

A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids

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

Characterizing weighted MSO for trees by branching transitive closure logics pdf

Zoltán Fülöp, Heiko Vogler, 2015, Theor. Comput. Sci..

Variants of top-down tree transducers with look-ahead

Sándor Vágvölgyi, Zoltán Fülöp, 2005, Mathematical systems theory.

Linear deterministic multi bottom-up tree transducers

Zoltán Fülöp, Heiko Vogler, Armin Kühnemann, 2005, Theor. Comput. Sci..

Weighted Tree-Walking Automata

Zoltán Fülöp, Lorand Muzamel, 2009, Acta Cybern..

Forward and backward application of symbolic tree transducers

Zoltán Fülöp, Heiko Vogler, 2014, Acta Informatica.

Iterated relabeling tree transducers

Zoltán Fülöp, Alain Terlutte, 2002, Theor. Comput. Sci..

Weighted Regular Tree Grammars with Storage

Zoltán Fülöp, Heiko Vogler, Luisa Herrmann, 2017, Discret. Math. Theor. Comput. Sci..

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

Zoltán Fülöp, 2017, Int. J. Found. Comput. Sci..

Proceedings 14th International Conference on Automata and Formal Languages: Preface

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

Local Weighted Tree Languages

Zoltán Fülöp, 2015, Acta Cybern..

Weighted Extended Tree Transducers

Zoltán Fülöp, Heiko Vogler, Andreas Maletti, 2011, Fundam. Informaticae.

Equational tree transformations

Zoltán Fülöp, George Rahonis, Symeon Bozapalidis, 2011, Theor. Comput. Sci..

Weighted Tree Automata over Multioperator Monoids

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

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

Sándor Vágvölgyi, Zoltán Fülöp, 1987, Acta Cybern..

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

Sándor Vágvölgyi, Zoltán Fülöp, 1989, Inf. Process. Lett..

Pebble Macro Tree Transducers with Strong Pebble Handling

Zoltán Fülöp, Lorand Muzamel, 2008, Fundam. Informaticae.

Automata, Languages and Programming

Zoltán Fülöp, Ferenc Gécseg, 1995, Lecture Notes in Computer Science.

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

Zoltán Fülöp, Zoltán Fülöp, 1991, Theor. Comput. Sci..

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids

Zoltán Fülöp, Heiko Vogler, Andreas Maletti, 2007, Theory of Computing Systems.

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

Zoltán Fülöp, G. Dányi, Zoltán Fülöp, 2001, Theor. Comput. Sci..

Macro Attributed Tree Transducers

Zoltán Fülöp, Heiko Vogler, 1998 .

Linking theorems for tree transducers

Zoltán Fülöp, Andreas Maletti, Zoltán Fülöp, 2016, J. Comput. Syst. Sci..

Composition Closure of Linear Weighted Extended Top-Down Tree Transducers

Zoltán Fülöp, Andreas Maletti, 2019, CIAA.

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

Zoltán Fülöp, Andreas Maletti, Zoltán Fülöp, 2013, Developments in Language Theory.

Development of a microcontroller-based system with hardware-in-the-loop method for real-time control algorithms prototyping

Zoltán Fülöp, Csaba Dr. Szász, 2014 .

In Memoriam Zoltán Ésik

Zoltán Fülöp, 2017, Acta Cybern..

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

Zoltán Fülöp, Heiko Vogler, 1999, Theory of Computing Systems.

In Memory of Professor Ferenc Gécseg

Zoltán Fülöp, Zoltán Ésik, 2015, Acta Cybern..

Developments in Language Theory

Zoltán Fülöp, Zoltán Ésik, 2003, Lecture Notes in Computer Science.

Syntax-Directed Semantics: Formal Models Based on Tree Transducers

Zoltán Fülöp, Heiko Vogler, 2011 .

Characterizations of recognizable weighted tree languages by logic and bimorphisms

Zoltán Fülöp, Heiko Vogler, 2018, Soft Comput..

Bounds for Tree Automata with Polynomial Costs

Zoltán Fülöp, Andreas Maletti, Zsolt Gazdag, 2005, J. Autom. Lang. Comb..

Superlinear deterministic top-down tree transducers

Zoltán Fülöp, G. Dányi, 2005, Mathematical systems theory.

Weighted Tree Transducers

Zoltán Fülöp, Heiko Vogler, H. Vogler, 2004, J. Autom. Lang. Comb..

A Characterization of Attributed Tree Transformations

Zoltán Fülöp, Heiko Vogler, 1997 .

Varieties of recognizable tree series over fields

Zoltán Fülöp, Magnus Steinby, 2011, Theor. Comput. Sci..

Distributed Tree Processing Devices

Zoltán Fülöp, 1999, Comput. Artif. Intell..

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

Sándor Vágvölgyi, Zoltán Fülöp, 1991, Bull. EATCS.

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

Sándor Vágvölgyi, Zoltán Fülöp, 1989, Bull. EATCS.

Undecidable Properties of Deterministic Top-Down Tree Transducers

Zoltán Fülöp, 1994, Theor. Comput. Sci..

Developments in language theory : 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003 : proceedings

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

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

Zoltán Fülöp, Heiko Vogler, H. Vogler, 2019, CAI.

Tree Series Transformations that Respect Copying

Zoltán Fülöp, Heiko Vogler, H. Vogler, 2003, Theory of Computing Systems.

Weighted tree automata and their characterization by logic - a summary

Zoltán Fülöp, 2016, NCMA.

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

Zoltán Fülöp, Magnus Steinby, 2009, Automata, Formal Languages, and Related Topics.

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

Sándor Vágvölgyi, Zoltán Fülöp, 1991, Theor. Comput. Sci..

Proceedings of the 7th international conference on Developments in language theory

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

An infinite hierarchy of tree transformations in the class NDR

Sándor Vágvölgyi, Zoltán Fülöp, 1987, Acta Cybern..

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

Zoltán Fülöp, Heiko Vogler, Torsten Stüber, 2010, Theory of Computing Systems.

Syntax-Directed Semantics

Zoltán Fülöp, Heiko Vogler, H. Vogler, 1998, Monographs in Theoretical Computer Science An EATCS Series.

Minimization of Deterministic Top-down Tree Automata

Sándor Vágvölgyi, Zoltán Fülöp, 2017, Acta Cybern..

A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars

Zoltán Fülöp, Sebastian Maneth, Zoltán Fülöp, 1999, Grammatical Models of Multi-Agent Systems.

Equational weighted tree transformations

Zoltán Fülöp, George Rahonis, Symeon Bozapalidis, 2012, Acta Informatica.

On attributed tree transducers

Zoltán Fülöp, 1981, Acta Cybern..

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

Sándor Vágvölgyi, Zoltán Fülöp, 1988, Acta Cybern..

Weighted Languages Recognizable by Weighted Tree Automata

Zoltán Fülöp, Zsolt Gazdag, Zoltán Fülöp, 2018, Acta Cybern..

On domains of tree tranducers

Sándor Vágvölgyi, Zoltán Fülöp, 1988, Bull. EATCS.

Decomposition results concerning K-visit attributed tree transducers

Zoltán Fülöp, 1983, Acta Cybern..

Proceedings of the 22nd International Colloquium on Automata, Languages and Programming

Zoltán Fülöp, Ferenc Gécseg, 1995 .

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

Tibor Csendes, Zoltán Fülöp, 1999, Acta Cybern..

On One-Pass Term Rewriting

Sándor Vágvölgyi, Zoltán Fülöp, Magnus Steinby, 1998, Acta Cybern..

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

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

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

Sándor Vágvölgyi, Zoltán Fülöp, 1990, Inf. Process. Lett..

Preservation of Recognizability for Synchronous Tree Substitution Grammars

Zoltán Fülöp, Heiko Vogler, Andreas Maletti, 2010, ATANLP@ACL 2010.

Domains of partial attributed tree transducers

Zoltán Fülöp, Sebastian Maneth, 2000, Inf. Process. Lett..

Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers

Zoltán Fülöp, 2001, J. Autom. Lang. Comb..

Decidability of the inclusion in monoids generated by tree transformation classes

Sándor Vágvölgyi, Zoltán Fülöp, 1992, Tree Automata and Languages.

Iterated Deterministic Top-Down Look-Ahead

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

Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthday

Zoltán Fülöp, Zoltán Ésik, 2009, Automata, Formal Languages, and Related Topics.

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

Zoltán Fülöp, Lorand Muzamel, 2008, J. Autom. Lang. Comb..

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

Manfred Droste, Zoltán Fülöp, Heiko Vogler, 2021, ArXiv.

Crisp-determinization of weighted tree automata over strong bimonoids

Zoltán Fülöp, Heiko Vogler, Dávid Kószó, 2021, Discret. Math. Theor. Comput. Sci..