Sándor Vágvölgyi
Orcid: 0000-0002-2647-9633Affiliations:
- University of Szeged, Hungary
According to our database1,
Sándor Vágvölgyi
authored at least 65 papers
between 1986 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited.
Int. J. Found. Comput. Sci., June, 2023
2022
Theor. Comput. Sci., 2022
2019
J. Log. Algebraic Methods Program., 2019
2018
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
2017
2016
2015
2014
2013
J. Log. Algebraic Methods Program., 2013
2011
Tree Homomorphisms for Unranked Trees.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011
2010
2009
Theor. Comput. Sci., 2009
Fundam. Informaticae, 2009
On Ranges of Bottom-up Tree Transducers.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009
2008
2007
2006
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules.
Inf. Process. Lett., 2006
2004
Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems.
Bull. EATCS, 2004
2003
Theor. Comput. Sci., 2003
Theor. Comput. Sci., 2003
2002
2001
Fundam. Informaticae, 2001
Proceedings of the Developments in Language Theory, 5th International Conference, 2001
2000
Theor. Comput. Sci., 2000
Intersection of Finitely Generated Congruences over the Term Algebra with Equal Trunks.
Bull. EATCS, 2000
1999
1998
Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability.
Theor. Comput. Sci., 1998
1997
Acta Informatica, 1997
1996
Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations.
Theor. Comput. Sci., 1996
1995
Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations
Inf. Comput., February, 1995
Theor. Comput. Sci., 1995
1994
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
Theor. Comput. Sci., 1994
1993
A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language.
Theor. Comput. Sci., 1993
1992
Theor. Comput. Sci., 1992
For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable.
Bull. EATCS, 1992
Decidability of the inclusion in monoids generated by tree transformation classes.
Proceedings of the Tree Automata and Languages., 1992
1991
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.
Bull. EATCS, 1991
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991
1990
Inf. Comput., June, 1990
The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations.
Inf. Process. Lett., 1990
1989
Inf. Process. Lett., 1989
Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen.
Bull. EATCS, 1989
Proceedings of the Fundamentals of Computation Theory, 1989
1988
On domains of tree tranducers.
Bull. EATCS, 1988
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
Acta Cybern., 1987
1986