Sándor Vágvölgyi

Publication Activity (10 Years)

Years Active: 1986-2023
Publications (10 Years): 7

Top Topics

Top Venues

J. Log. Algebraic Methods Program.

Theor. Comput. Sci.

Publications

Zsolt Gazdag, Sándor Vágvölgyi
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited. Int. J. Found. Comput. Sci. 34 (4) (2023)
Sándor Vágvölgyi
Deterministic top-down tree automata with Boolean deterministic look-ahead. Theor. Comput. Sci. 927 (2022)
Sándor Vágvölgyi
Some decidability results on one-pass reductions. J. Log. Algebraic Methods Program. 105 (2019)
Sándor Vágvölgyi
Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems. Inf. Process. Lett. 134 (2018)
Sándor Vágvölgyi
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy. Theor. Comput. Sci. 732 (2018)
Zoltán Fülöp, Sándor Vágvölgyi
Minimization of Deterministic Top-down Tree Automata. Acta Cybern. 23 (1) (2017)
Sándor Vágvölgyi
One-Pass Reductions. Acta Cybern. 22 (3) (2016)
Sándor Vágvölgyi
On Ground Word Problem of Term Equation Systems. Acta Cybern. 22 (2) (2015)
Sándor Vágvölgyi
Symbol different term rewrite systems. J. Log. Algebraic Methods Program. 84 (5) (2015)
Sándor Vágvölgyi
Tree shuffle. Theor. Comput. Sci. 521 (2014)
Sándor Vágvölgyi
Rewriting preserving recognizability of finite tree languages. J. Log. Algebraic Methods Program. 82 (2) (2013)
Sándor Vágvölgyi
Threefold Post Correspondence System. CoRR (2013)
Sándor Vágvölgyi
Recognizing Relations by Tree Automata. J. Autom. Lang. Comb. 18 (2) (2013)
Xiaoxue Piao, Kai Salomaa, Sándor Vágvölgyi
Tree Homomorphisms for Unranked Trees. AFL (2011)
Sándor Vágvölgyi
CHAP and rewrite components. Acta Informatica 48 (5-6) (2011)
Sándor Vágvölgyi
Rewriting Preserving Recognizability of Finite Tree Languages CoRR (2010)
Sándor Vágvölgyi
Ground Term Rewriting. Bull. EATCS 102 (2010)
Sándor Vágvölgyi
Deterministic bottom-up tree transducers and ground term rewrite systems. Theor. Comput. Sci. 410 (21-23) (2009)
Sándor Vágvölgyi
Congruences Generated by Extended Ground Term Rewrite Systems. Fundam. Informaticae 95 (2-3) (2009)
Sándor Vágvölgyi
On Ranges of Bottom-up Tree Transducers. Automata, Formal Languages, and Related Topics (2009)
Sándor Vágvölgyi
On ground word problem of term equation systems CoRR (2009)
Sándor Vágvölgyi
Murg term rewrite systems. Inf. Process. Lett. 108 (5) (2008)
Sándor Vágvölgyi
Losing recognizability. Theor. Comput. Sci. 379 (1-2) (2007)
Sándor Vágvölgyi
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules. Inf. Process. Lett. 99 (3) (2006)
Sándor Vágvölgyi
Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems. Bull. EATCS 82 (2004)
Tamás Hornung, Sándor Vágvölgyi
Storage-to-tree transducers with look-ahead. Theor. Comput. Sci. 329 (1-3) (2004)
Sándor Vágvölgyi
On ground tree transformations and congruences induced by tree automata. Theor. Comput. Sci. 304 (1-3) (2003)
Sándor Vágvölgyi
Intersection of finitely generated congruences over term algebra. Theor. Comput. Sci. 300 (1-3) (2003)
Sándor Vágvölgyi
Right-linear half-monadic term rewrite systems. Theor. Comput. Sci. 309 (1-3) (2003)
Sándor Vágvölgyi
Term rewriting restricted to ground terms. Theor. Comput. Sci. 302 (1-3) (2003)
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
Shuffle Decompositions of Regular Languages. Int. J. Found. Comput. Sci. 13 (6) (2002)
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
Shuffle Quotient and Decompositions. Developments in Language Theory (2001)
Zoltán Fülöp, Sándor Vágvölgyi
Restricted ground tree transducers. Theor. Comput. Sci. 250 (1-2) (2001)
János Apró, Sándor Vágvölgyi
The Ground Tree Transducer Game with Identical Tree Automata. Fundam. Informaticae 45 (3) (2001)
Sándor Vágvölgyi
Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks. Bull. EATCS 71 (2000)
Pál Gyenizse, Sándor Vágvölgyi
A property of left-linear rewrite systems preserving recognizability. Theor. Comput. Sci. 242 (1-2) (2000)
Sándor Vágvölgyi
Congruential complements of ground term rewrite systems. Theor. Comput. Sci. 238 (1-2) (2000)
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
On One-Pass Term Rewriting. Acta Cybern. 14 (1) (1999)
Pál Gyenizse, Sándor Vágvölgyi
Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. Theor. Comput. Sci. 194 (1-2) (1998)
Sándor Vágvölgyi
Simple and Minimal Ground Term Equation Systems. Fundam. Informaticae 36 (4) (1998)
Sándor Vágvölgyi
The Ground Tree Transducer Game. Fundam. Informaticae 34 (1-2) (1998)
Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
On One-Pass Term Rewriting. MFCS (1998)
Zoltán Fülöp, Sándor Vágvölgyi
Minimal Equational Representations of Recognizable Tree Languages. Acta Informatica 34 (1) (1997)
Giora Slutzki, Sándor Vágvölgyi
A Hierarchy of Deterministic Top-Down Tree Transformations. Math. Syst. Theory 29 (2) (1996)
Pál Gyenizse, Sándor Vágvölgyi
Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations. Theor. Comput. Sci. 156 (1&2) (1996)
Zoltán Fülöp, Sándor Vágvölgyi
Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations Inf. Comput. 116 (2) (1995)
Giora Slutzki, Sándor Vágvölgyi
Deterministic Top-Down Tree Transducers with Iterated Lookahead. Theor. Comput. Sci. 143 (2) (1995)
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. Theor. Comput. Sci. 127 (1) (1994)
Giora Slutzki, Sándor Vágvölgyi
A Hierarchy of Deterministic Top-down Tree Transformations. FCT (1993)
Zoltán Fülöp, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler
Tree Transducers with External Functions. Theor. Comput. Sci. 108 (2) (1993)
Sándor Vágvölgyi
A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language. Theor. Comput. Sci. 115 (2) (1993)
Sándor Vágvölgyi, Rémi Gilleron
For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. Bull. EATCS 48 (1992)
Sándor Vágvölgyi
Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. Theor. Comput. Sci. 93 (1) (1992)
Zoltán Fülöp, Sándor Vágvölgyi
A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes. Theor. Comput. Sci. 81 (1) (1991)
Zoltán Fülöp, Sándor Vágvölgyi
Ground Term Rewriting Rules for the Word Problem of Ground Term Equations. Bull. EATCS 45 (1991)
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
Bottom-Up Tree Pushdown Automata and Rewrite Systems. RTA (1991)
Zoltán Fülöp, Sándor Vágvölgyi
The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. Inf. Process. Lett. 36 (6) (1990)
Zoltán Fülöp, Sándor Vágvölgyi
A Complete Rewriting System for a Monoid of Tree Transformation Classes Inf. Comput. 86 (2) (1990)
Zoltán Fülöp, Sándor Vágvölgyi
Iterated Deterministic Top-Down Look-Ahead. FCT (1989)
Zoltán Fülöp, Sándor Vágvölgyi
Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. Bull. EATCS 39 (1989)
Zoltán Fülöp, Sándor Vágvölgyi
Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. Inf. Process. Lett. 33 (1) (1989)
Zoltán Fülöp, Sándor Vágvölgyi
Variants of Top-Down Tree Transducers With Look-Ahead. Math. Syst. Theory 21 (3) (1989)
Zoltán Fülöp, Sándor Vágvölgyi
A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata. ALP (1988)
Zoltán Fülöp, Sándor Vágvölgyi
On domains of tree tranducers. Bull. EATCS 34 (1988)
Sándor Vágvölgyi, Zoltán Fülöp
On ranges of compositions of deterministic root-to-frontier tree transformations. Acta Cybern. 8 (3) (1988)
Sándor Vágvölgyi, Zoltán Fülöp
An infinite hierarchy of tree transformations in the class NDR. Acta Cybern. 8 (2) (1987)
Zoltán Fülöp, Sándor Vágvölgyi
Results on compositions of deterministic root-to-frontier tree transformations. Acta Cybern. 8 (1) (1987)
Sándor Vágvölgyi
On compositions of root-to-frontier tree transformations. Acta Cybern. 7 (4) (1986)