AAAAAA
Results:
1-8
|
Results: 8
Authors:
GYENIZSE P
VAGVOLGYI S
Citation: P. Gyenizse et S. Vagvolgyi, LINEAR GENERALIZED SEMI-MONADIC REWRITE SYSTEMS EFFECTIVELY PRESERVE RECOGNIZABILITY, Theoretical computer science, 194(1-2), 1998, pp. 87-122
Authors:
FULOP Z
VAGVOLGYI S
Citation: Z. Fulop et S. Vagvolgyi, MINIMAL EQUATIONAL REPRESENTATIONS OF RECOGNIZABLE TREE-LANGUAGES, Acta informatica, 34(1), 1997, pp. 59-84
Authors:
GYENIZSE P
VAGVOLGYI S
Citation: P. Gyenizse et S. Vagvolgyi, COMPOSITIONS OF DETERMINISTIC BOTTOM-UP, TOP-DOWN, AND REGULAR LOOK-AHEAD TREE-TRANSFORMATIONS, Theoretical computer science, 156(1-2), 1996, pp. 71-97
Authors:
SLUTZKI G
VAGVOLGYI S
Citation: G. Slutzki et S. Vagvolgyi, A HIERARCHY OF DETERMINISTIC TOP-DOWN TREE-TRANSFORMATIONS, Mathematical systems theory, 29(2), 1996, pp. 169-188
Authors:
FULOP Z
VAGVOLGYI S
Citation: Z. Fulop et S. Vagvolgyi, ATTRIBUTED TREE-TRANSDUCERS CANNOT INDUCE ALL DETERMINISTIC BOTTOM-UPTREE-TRANSFORMATIONS, Information and computation, 116(2), 1995, pp. 231-240
Authors:
SLUTZKI G
VAGVOLGYI S
Citation: G. Slutzki et S. Vagvolgyi, DETERMINISTIC TOP-DOWN TREE-TRANSDUCERS WITH ITERATED LOOK-AHEAD, Theoretical computer science, 143(2), 1995, pp. 285-308
Authors:
COQUIDE JL
DAUCHET M
GILLERON R
VAGVOLGYI S
Citation: Jl. Coquide et al., BOTTOM-UP TREE PUSHDOWN-AUTOMATA - CLASSIFICATION AND CONNECTION WITHREWRITE SYSTEMS, Theoretical computer science, 127(1), 1994, pp. 69-98
Authors:
VAGVOLGYI S
Citation: S. Vagvolgyi, A FAST ALGORITHM FOR CONSTRUCTING A TREE AUTOMATON RECOGNIZING A CONGRUENTIAL TREE LANGUAGE, Theoretical computer science, 115(2), 1993, pp. 391-399
Risultati:
1-8
|