Zoltán Fülöp

According to our database1, Zoltán Fülöp
  • authored at least 74 papers between 1981 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Composition Closure of Linear Extended Top-down Tree Transducers.
Theory Comput. Syst., 2017

Weighted Regular Tree Grammars with Storage.
CoRR, 2017

Minimization of Deterministic Top-down Tree Automata.
Acta Cybern., 2017

In Memoriam Zoltán Ésik.
Acta Cybern., 2017

Preface.
Acta Cybern., 2017

2016
Linking theorems for tree transducers.
J. Comput. Syst. Sci., 2016

Weighted tree automata and their characterization by logic - a summary.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
Characterizing weighted MSO for trees by branching transitive closure logics.
Theor. Comput. Sci., 2015

In Memory of Professor Ferenc Gécseg.
Acta Cybern., 2015

Local Weighted Tree Languages.
Acta Cybern., 2015

2014
Forward and backward application of symbolic tree transducers.
Acta Inf., 2014

2013
Composition Closure of Linear Extended Top-down Tree Transducers
CoRR, 2013

Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids.
Theory Comput. Syst., 2012

Forward and Backward Application of Symbolic Tree Transducers
CoRR, 2012

Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics
CoRR, 2012

Equational weighted tree transformations.
Acta Inf., 2012

2011
Varieties of recognizable tree series over fields.
Theor. Comput. Sci., 2011

Equational tree transformations.
Theor. Comput. Sci., 2011

Weighted Extended Tree Transducers.
Fundam. Inform., 2011

Equational Weighted Tree Transformations with Discounting.
Proceedings of the Algebraic Foundations in Computer Science, 2011

2009
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.
Theory Comput. Syst., 2009

Decomposition of Weighted multioperator Tree Automata.
Int. J. Found. Comput. Sci., 2009

Weighted Tree-Walking Automata.
Acta Cybern., 2009

Formal Series of General Algebras over a Field and Their Syntactic Algebras.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008
Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers.
Journal of Automata, Languages and Combinatorics, 2008

Pebble Macro Tree Transducers with Strong Pebble Handling.
Fundam. Inform., 2008

2005
Linear deterministic multi bottom-up tree transducers.
Theor. Comput. Sci., 2005

Bounds for Tree Automata with Polynomial Costs.
Journal of Automata, Languages and Combinatorics, 2005

2004
Hierarchies of tree series transformations.
Theor. Comput. Sci., 2004

Foreword.
Theor. Comput. Sci., 2004

Weighted Tree Transducers.
Journal of Automata, Languages and Combinatorics, 2004

A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead.
Inf. Process. Lett., 2004

2003
Shape preserving top-down tree transducers.
Theor. Comput. Sci., 2003

Tree Series Transformations that Respect Copying.
Theory Comput. Syst., 2003

2002
Iterated relabeling tree transducers.
Theor. Comput. Sci., 2002

Bottom-Up and Top-Down Tree Series Transformations.
Journal of Automata, Languages and Combinatorics, 2002

2001
Restricted ground tree transducers.
Theor. Comput. Sci., 2001

The component hierarchy of chain-free cooperating distributed regular tree grammars.
Theor. Comput. Sci., 2001

Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers.
Journal of Automata, Languages and Combinatorics, 2001

2000
Domains of partial attributed tree transducers.
Inf. Process. Lett., 2000

1999
A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers.
Theory Comput. Syst., 1999

Distributed Tree Processing Devices.
Computers and Artificial Intelligence, 1999

On One-Pass Term Rewriting.
Acta Cybern., 1999

Preface - Papers from the Conference for PhD Students in Computer Science.
Acta Cybern., 1999

A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

1998
Syntax-Directed Semantics - Formal Models Based on Tree Transducers
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-72248-6, 1998

Compositions with Superlinear Deterministic Top-Down Tree Transformations.
Theor. Comput. Sci., 1998

On One-Pass Term Rewriting.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Minimal Equational Representations of Recognizable Tree Languages.
Acta Inf., 1997

1996
Superlinear Deterministic Top-Down Tree Transducers.
Mathematical Systems Theory, 1996

A Note on the Equivalence Problem of E-Patterns.
Inf. Process. Lett., 1996

1995
Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations
Inf. Comput., February, 1995

1994
Undecidable Properties of Deterministic Top-Down Tree Transducers.
Theor. Comput. Sci., 1994

1993
Tree Transducers with External Functions.
Theor. Comput. Sci., 1993

On Injectivity of Deterministic Top-Down Tree Transducers.
Inf. Process. Lett., 1993

1992
Decidability of the inclusion in monoids generated by tree transformation classes.
Tree Automata and Languages, 1992

1991
A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes.
Theor. Comput. Sci., 1991

A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes.
Theor. Comput. Sci., 1991

Ground Term Rewriting Rules for the Word Problem of Ground Term Equations.
Bulletin of the EATCS, 1991

1990
A Complete Rewriting System for a Monoid of Tree Transformation Classes
Inf. Comput., June, 1990

The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations.
Inf. Process. Lett., 1990

1989
Variants of Top-Down Tree Transducers With Look-Ahead.
Mathematical Systems Theory, 1989

Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead.
Inf. Process. Lett., 1989

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

Iterated Deterministic Top-Down Look-Ahead.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
On domains of tree tranducers.
Bulletin of the EATCS, 1988

On ranges of compositions of deterministic root-to-frontier tree transformations.
Acta Cybern., 1988

A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata.
Proceedings of the Algebraic and Logic Programming, 1988

1987
An infinite hierarchy of tree transformations in the class NDR.
Acta Cybern., 1987

Results on compositions of deterministic root-to-frontier tree transformations.
Acta Cybern., 1987

1983
Decomposition results concerning K-visit attributed tree transducers.
Acta Cybern., 1983

1981
On attributed tree transducers.
Acta Cybern., 1981


  Loading...