Sándor Vágvölgyi

According to our database1, Sándor Vágvölgyi authored at least 66 papers between 1986 and 2018.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 



On csauthors.net:


Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy.
Theor. Comput. Sci., 2018

Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems.
Inf. Process. Lett., 2018

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

One-Pass Reductions.
Acta Cybern., 2016

Symbol different term rewrite systems.
J. Log. Algebr. Meth. Program., 2015

On Ground Word Problem of Term Equation Systems.
Acta Cybern., 2015

Tree shuffle.
Theor. Comput. Sci., 2014

Rewriting preserving recognizability of finite tree languages.
J. Log. Algebr. Program., 2013

Recognizing Relations by Tree Automata.
Journal of Automata, Languages and Combinatorics, 2013

Threefold Post Correspondence System.
CoRR, 2013

CHAP and rewrite components.
Acta Inf., 2011

Tree Homomorphisms for Unranked Trees.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

Ground Term Rewriting.
Bulletin of the EATCS, 2010

Rewriting Preserving Recognizability of Finite Tree Languages
CoRR, 2010

Deterministic bottom-up tree transducers and ground term rewrite systems.
Theor. Comput. Sci., 2009

Congruences Generated by Extended Ground Term Rewrite Systems.
Fundam. Inform., 2009

On ground word problem of term equation systems
CoRR, 2009

On Ranges of Bottom-up Tree Transducers.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009

Murg term rewrite systems.
Inf. Process. Lett., 2008

Losing recognizability.
Theor. Comput. Sci., 2007

Descendants of a recognizable tree language for sets of linear monadic term rewrite rules.
Inf. Process. Lett., 2006

Storage-to-tree transducers with look-ahead.
Theor. Comput. Sci., 2004

Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems.
Bulletin of the EATCS, 2004

Right-linear half-monadic term rewrite systems.
Theor. Comput. Sci., 2003

Intersection of finitely generated congruences over term algebra.
Theor. Comput. Sci., 2003

Term rewriting restricted to ground terms.
Theor. Comput. Sci., 2003

On ground tree transformations and congruences induced by tree automata.
Theor. Comput. Sci., 2003

Shuffle Decompositions of Regular Languages.
Int. J. Found. Comput. Sci., 2002

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

The Ground Tree Transducer Game with Identical Tree Automata.
Fundam. Inform., 2001

Shuffle Quotient and Decompositions.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Congruential complements of ground term rewrite systems.
Theor. Comput. Sci., 2000

A property of left-linear rewrite systems preserving recognizability.
Theor. Comput. Sci., 2000

Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks.
Bulletin of the EATCS, 2000

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

Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability.
Theor. Comput. Sci., 1998

Simple and Minimal Ground Term Equation Systems.
Fundam. Inform., 1998

The Ground Tree Transducer Game.
Fundam. Inform., 1998

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

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

Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations.
Theor. Comput. Sci., 1996

A Hierarchy of Deterministic Top-Down Tree Transformations.
Mathematical Systems Theory, 1996

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

Deterministic Top-Down Tree Transducers with Iterated Lookahead.
Theor. Comput. Sci., 1995

Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
Theor. Comput. Sci., 1994

A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language.
Theor. Comput. Sci., 1993

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

A Hierarchy of Deterministic Top-down Tree Transformations.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead.
Theor. Comput. Sci., 1992

For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable.
Bulletin of the EATCS, 1992

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

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

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

Bottom-Up Tree Pushdown Automata and Rewrite Systems.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

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

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

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

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

On compositions of root-to-frontier tree transformations.
Acta Cybern., 1986