Sándor Vágvölgyi

71 papers B 3C 1Journal 62Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Tail reduction free term rewriting systems revisited.
J. Symb. Comput.
Sándor Vágvölgyi
2024 J jnl
Union of Finitely Generated Congruences on Ground Term Algebra.
CoRR
Sándor Vágvölgyi
2023 J jnl
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited.
Int. J. Found. Comput. Sci.
Zsolt Gazdag, Sándor Vágvölgyi
2022 J jnl
Deterministic top-down tree automata with Boolean deterministic look-ahead.
Theor. Comput. Sci.
Sándor Vágvölgyi
2019 J jnl
Some decidability results on one-pass reductions.
J. Log. Algebraic Methods Program.
Sándor Vágvölgyi
2018 J jnl
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy.
Theor. Comput. Sci.
Sándor Vágvölgyi
2018 J jnl
Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems.
Inf. Process. Lett.
Sándor Vágvölgyi
2017 J jnl
Minimization of Deterministic Top-down Tree Automata.
Acta Cybern.
Zoltán Fülöp, Sándor Vágvölgyi
2016 J jnl
One-Pass Reductions.
Acta Cybern.
Sándor Vágvölgyi
2015 J jnl
On Ground Word Problem of Term Equation Systems.
Acta Cybern.
Sándor Vágvölgyi
2015 J jnl
Symbol different term rewrite systems.
J. Log. Algebraic Methods Program.
Sándor Vágvölgyi
2014 J jnl
Tree shuffle.
Theor. Comput. Sci.
Sándor Vágvölgyi
2013 J jnl
Recognizing Relations by Tree Automata.
J. Autom. Lang. Comb.
Sándor Vágvölgyi
2013 J jnl
Rewriting preserving recognizability of finite tree languages.
J. Log. Algebraic Methods Program.
Sándor Vágvölgyi
2013 J jnl
Threefold Post Correspondence System.
CoRR
Sándor Vágvölgyi
2011 J jnl
CHAP and rewrite components.
Acta Informatica
Sándor Vágvölgyi
2011 — conf
Tree Homomorphisms for Unranked Trees.
AFL
Xiaoxue Piao, Kai Salomaa, Sándor Vágvölgyi
2010 J jnl
Ground Term Rewriting.
Bull. EATCS
Sándor Vágvölgyi
2010 J jnl
Rewriting Preserving Recognizability of Finite Tree Languages
CoRR
Sándor Vágvölgyi
2009 J jnl
Congruences Generated by Extended Ground Term Rewrite Systems.
Fundam. Informaticae
Sándor Vágvölgyi
2009 J jnl
Deterministic bottom-up tree transducers and ground term rewrite systems.
Theor. Comput. Sci.
Sándor Vágvölgyi
2009 — conf
On Ranges of Bottom-up Tree Transducers.
Automata, Formal Languages, and Related Topics
Sándor Vágvölgyi
2009 J jnl
On ground word problem of term equation systems
CoRR
Sándor Vágvölgyi
2008 J jnl
Murg term rewrite systems.
Inf. Process. Lett.
Sándor Vágvölgyi
2007 J jnl
Losing recognizability.
Theor. Comput. Sci.
Sándor Vágvölgyi
2006 J jnl
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules.
Inf. Process. Lett.
Sándor Vágvölgyi
2004 J jnl
Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems.
Bull. EATCS
Sándor Vágvölgyi
2004 J jnl
Storage-to-tree transducers with look-ahead.
Theor. Comput. Sci.
Tamás Hornung, Sándor Vágvölgyi
2003 J jnl
Intersection of finitely generated congruences over term algebra.
Theor. Comput. Sci.
Sándor Vágvölgyi
2003 J jnl
On ground tree transformations and congruences induced by tree automata.
Theor. Comput. Sci.
Sándor Vágvölgyi
2003 J jnl
Right-linear half-monadic term rewrite systems.
Theor. Comput. Sci.
Sándor Vágvölgyi
2003 J jnl
Term rewriting restricted to ground terms.
Theor. Comput. Sci.
Sándor Vágvölgyi
2002 J jnl
Shuffle Decompositions of Regular Languages.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
2001 J jnl
Restricted ground tree transducers.
Theor. Comput. Sci.
Zoltán Fülöp, Sándor Vágvölgyi
2001 C conf
Shuffle Quotient and Decompositions.
Developments in Language Theory
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
2001 J jnl
The Ground Tree Transducer Game with Identical Tree Automata.
Fundam. Informaticae
János Apró, Sándor Vágvölgyi
2000 J jnl
A property of left-linear rewrite systems preserving recognizability.
Theor. Comput. Sci.
Pál Gyenizse, Sándor Vágvölgyi
2000 J jnl
Congruential complements of ground term rewrite systems.
Theor. Comput. Sci.
Sándor Vágvölgyi
2000 J jnl
Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks.
Bull. EATCS
Sándor Vágvölgyi
1999 J jnl
On One-Pass Term Rewriting.
Acta Cybern.
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
1998 J jnl
Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability.
Theor. Comput. Sci.
Pál Gyenizse, Sándor Vágvölgyi
1998 B conf
On One-Pass Term Rewriting.
MFCS
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
1998 J jnl
Simple and Minimal Ground Term Equation Systems.
Fundam. Informaticae
Sándor Vágvölgyi
1998 J jnl
The Ground Tree Transducer Game.
Fundam. Informaticae
Sándor Vágvölgyi
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 Hierarchy of Deterministic Top-Down Tree Transformations.
Math. Syst. Theory
Giora Slutzki, Sándor Vágvölgyi
1996 J jnl
Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations.
Theor. Comput. Sci.
Pál Gyenizse, Sándor Vágvölgyi
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 J jnl
Deterministic Top-Down Tree Transducers with Iterated Lookahead.
Theor. Comput. Sci.
Giora Slutzki, Sándor Vágvölgyi
1994 J jnl
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
Theor. Comput. Sci.
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
1993 J jnl
A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language.
Theor. Comput. Sci.
Sándor Vágvölgyi
1993 B conf
A Hierarchy of Deterministic Top-down Tree Transformations.
FCT
Giora Slutzki, Sándor Vágvölgyi
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
1992 J jnl
For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable.
Bull. EATCS
Sándor Vágvölgyi, Rémi Gilleron
1992 J jnl
Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead.
Theor. Comput. Sci.
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 — conf
Bottom-Up Tree Pushdown Automata and Rewrite Systems.
RTA
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
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
1986 J jnl
On compositions of root-to-frontier tree transformations.
Acta Cybern.
Sándor Vágvölgyi