On compositions of root-to-frontier tree transformations. - Sándor Vágvölgyi (Acta Cybern., 1986)

Results on compositions of deterministic root-to-frontier tree transformations. - Zoltán Fülöp 001; Sándor Vágvölgyi (Acta Cybern., 1987)

An infinite hierarchy of tree transformations in the class NDR. - Sándor Vágvölgyi; Zoltán Fülöp 001 (Acta Cybern., 1987)

A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata. - Zoltán Fülöp 001; Sándor Vágvölgyi (ALP, 1988)

On ranges of compositions of deterministic root-to-frontier tree transformations. - Sándor Vágvölgyi; Zoltán Fülöp 001 (Acta Cybern., 1988)

On domains of tree tranducers. - Zoltán Fülöp 001; Sándor Vágvölgyi (Bull. EATCS, 1988)

Iterated Deterministic Top-Down Look-Ahead. - Zoltán Fülöp 001; Sándor Vágvölgyi (FCT, 1989)

Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. - Zoltán Fülöp 001; Sándor Vágvölgyi (Bull. EATCS, 1989)

Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. - Zoltán Fülöp 001; Sándor Vágvölgyi (Inf. Process. Lett., 1989)

Variants of Top-Down Tree Transducers With Look-Ahead. - Zoltán Fülöp 001; Sándor Vágvölgyi (Math. Syst. Theory, 1989)

The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. - Zoltán Fülöp 001; Sándor Vágvölgyi (Inf. Process. Lett., 1990)

A Complete Rewriting System for a Monoid of Tree Transformation Classes - Zoltán Fülöp 001; Sándor Vágvölgyi (Inf. Comput., 1990)

Bottom-Up Tree Pushdown Automata and Rewrite Systems. - Jean-Luc Coquidé; Max Dauchet; Rémi Gilleron; Sándor Vágvölgyi (RTA, 1991)

Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. - Zoltán Fülöp 001; Sándor Vágvölgyi (Bull. EATCS, 1991)

A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. - Zoltán Fülöp 001; Sándor Vágvölgyi (Theor. Comput. Sci., 1991)

Decidability of the inclusion in monoids generated by tree transformation classes. - Zoltán Fülöp 001; Sándor Vágvölgyi (Tree Automata and Languages, 1992)

For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. - Sándor Vágvölgyi; Rémi Gilleron (Bull. EATCS, 1992)

Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. - Sándor Vágvölgyi (Theor. Comput. Sci., 1992)

Tree Transducers with External Functions. - Zoltán Fülöp 001; Frank Herrmann; Sándor Vágvölgyi; Heiko Vogler (Theor. Comput. Sci., 1993)

A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language. - Sándor Vágvölgyi (Theor. Comput. Sci., 1993)

Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. - Jean-Luc Coquidé; Max Dauchet; Rémi Gilleron; Sándor Vágvölgyi (Theor. Comput. Sci., 1994)

Deterministic Top-Down Tree Transducers with Iterated Lookahead. - Giora Slutzki; Sándor Vágvölgyi (Theor. Comput. Sci., 1995)

Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations - Zoltán Fülöp 001; Sándor Vágvölgyi (Inf. Comput., 1995)

A Hierarchy of Deterministic Top-Down Tree Transformations. - Giora Slutzki; Sándor Vágvölgyi (Math. Syst. Theory, 1996)

Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations. - Pál Gyenizse; Sándor Vágvölgyi (Theor. Comput. Sci., 1996)

Minimal Equational Representations of Recognizable Tree Languages. - Zoltán Fülöp 001; Sándor Vágvölgyi (Acta Informatica, 1997)

The Ground Tree Transducer Game. - Sándor Vágvölgyi (Fundam. Informaticae, 1998)

Simple and Minimal Ground Term Equation Systems. - Sándor Vágvölgyi (Fundam. Informaticae, 1998)

Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. - Pál Gyenizse; Sándor Vágvölgyi (Theor. Comput. Sci., 1998)

On One-Pass Term Rewriting. - Zoltán Fülöp 001; Eija Jurvanen; Magnus Steinby; Sándor Vágvölgyi (Acta Cybern., 1999)

Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks. - Sándor Vágvölgyi (Bull. EATCS, 2000)

A property of left-linear rewrite systems preserving recognizability. - Pál Gyenizse; Sándor Vágvölgyi (Theor. Comput. Sci., 2000)

Congruential complements of ground term rewrite systems. - Sándor Vágvölgyi (Theor. Comput. Sci., 2000)

Shuffle Quotient and Decompositions. - Cezar Câmpeanu; Kai Salomaa; Sándor Vágvölgyi (Developments in Language Theory, 2001)

The Ground Tree Transducer Game with Identical Tree Automata. - János Apró; Sándor Vágvölgyi (Fundam. Informaticae, 2001)

Restricted ground tree transducers. - Zoltán Fülöp 001; Sándor Vágvölgyi (Theor. Comput. Sci., 2001)

Shuffle Decompositions of Regular Languages. - Cezar Câmpeanu; Kai Salomaa; Sándor Vágvölgyi (Int. J. Found. Comput. Sci., 2002)

On ground tree transformations and congruences induced by tree automata. - Sándor Vágvölgyi (Theor. Comput. Sci., 2003)

Term rewriting restricted to ground terms. - Sándor Vágvölgyi (Theor. Comput. Sci., 2003)

Intersection of finitely generated congruences over term algebra. - Sándor Vágvölgyi (Theor. Comput. Sci., 2003)

Right-linear half-monadic term rewrite systems. - Sándor Vágvölgyi (Theor. Comput. Sci., 2003)

Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems. - Sándor Vágvölgyi (Bull. EATCS, 2004)

Storage-to-tree transducers with look-ahead. - Tamás Hornung; Sándor Vágvölgyi (Theor. Comput. Sci., 2004)

Descendants of a recognizable tree language for sets of linear monadic term rewrite rules. - Sándor Vágvölgyi (Inf. Process. Lett., 2006)

Losing recognizability. - Sándor Vágvölgyi (Theor. Comput. Sci., 2007)

Murg term rewrite systems. - Sándor Vágvölgyi (Inf. Process. Lett., 2008)

On Ranges of Bottom-up Tree Transducers. - Sándor Vágvölgyi (Automata, Formal Languages, and Related Topics, 2009)

Congruences Generated by Extended Ground Term Rewrite Systems. - Sándor Vágvölgyi (Fundam. Informaticae, 2009)

Deterministic bottom-up tree transducers and ground term rewrite systems. - Sándor Vágvölgyi (Theor. Comput. Sci., 2009)

Ground Term Rewriting. - Sándor Vágvölgyi (Bull. EATCS, 2010)

Tree Homomorphisms for Unranked Trees. - Xiaoxue Piao; Kai Salomaa; Sándor Vágvölgyi (AFL, 2011)

CHAP and rewrite components. - Sándor Vágvölgyi (Acta Informatica, 2011)

Threefold Post Correspondence System. - Sándor Vágvölgyi (CoRR, 2013)

Recognizing Relations by Tree Automata. - Sándor Vágvölgyi (J. Autom. Lang. Comb., 2013)

Rewriting preserving recognizability of finite tree languages. - Sándor Vágvölgyi (J. Log. Algebraic Methods Program., 2013)

Tree shuffle. - Sándor Vágvölgyi (Theor. Comput. Sci., 2014)

On Ground Word Problem of Term Equation Systems. - Sándor Vágvölgyi (Acta Cybern., 2015)

Symbol different term rewrite systems. - Sándor Vágvölgyi (J. Log. Algebraic Methods Program., 2015)

One-Pass Reductions. - Sándor Vágvölgyi (Acta Cybern., 2016)

Minimization of Deterministic Top-down Tree Automata. - Zoltán Fülöp 001; Sándor Vágvölgyi (Acta Cybern., 2017)

Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems. - Sándor Vágvölgyi (Inf. Process. Lett., 2018)

Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy. - Sándor Vágvölgyi (Theor. Comput. Sci., 2018)

Some decidability results on one-pass reductions. - Sándor Vágvölgyi (J. Log. Algebraic Methods Program., 2019)

Deterministic top-down tree automata with Boolean deterministic look-ahead. - Sándor Vágvölgyi (Theor. Comput. Sci., 2022)

The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited. - Zsolt Gazdag; Sándor Vágvölgyi (Int. J. Found. Comput. Sci., 2023)

Union of Finitely Generated Congruences on Ground Term Algebra. - Sándor Vágvölgyi (CoRR, 2024)

Tail reduction free term rewriting systems revisited. - Sándor Vágvölgyi (J. Symb. Comput., 2026)