-
2
-
-
84937714416
-
The recognizability problem for tree automata with comparisons between brothers
-
In W. Thomas, editor, number 1578 in Lecture Notes in Computer Science, Amsterdam, Springer Verlag
-
B. Bogaert, F. Seynhaeve, and S. Tison. The recognizability problem for tree automata with comparisons between brothers. In W. Thomas, editor, Proceedings, Foundations of Software Science and Computation Structures, number 1578 in Lecture Notes in Computer Science, Amsterdam, 1999. Springer Verlag.
-
(1999)
Proceedings, Foundations of Software Science and Computation Structures
-
-
Bogaert, B.1
Seynhaeve, F.2
Tison, S.3
-
3
-
-
0004060205
-
-
H. Comon, M. Dauchet, Gilleron, R., F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
-
(1997)
Tree Automata Techniques and Applications
-
-
Comon, H.1
Dauchet, M.2
Gilleron, R.3
Jacquemard, F.4
Lugiez, D.5
Tison, S.6
Tommasi, M.7
-
4
-
-
0028769280
-
Bottom-up tree pushdown automata: Classification and connection with rewrite systems
-
J.L. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvolgyi. Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Theorical Computer Science, 127:69-98, 1994.
-
(1994)
Theorical Computer Science
, vol.127
, pp. 69-98
-
-
Coquid, J.L.1
Édauchet, M.2
Gilleron, R.3
Vágvolgyi, S.4
-
7
-
-
0000988941
-
Bottom-up and top-down tree transformations. A comparision
-
J. Engelfriet. Bottom-up and top-down tree transformations. a comparision. Mathematical System Theory, 9:198-231, 1975.
-
(1975)
Mathematical System Theory
, vol.9
, pp. 198-231
-
-
Engelfriet, J.1
-
11
-
-
84896692991
-
On one-pass term rewriting
-
L. Brim, J. Gruska, and J. Zlatusaksv, editors, Lecture Notes in Computer Science, Springer Verlag
-
A. Fülöp, E. Jurvanen, M. Steinby, and S. Vágvölgy. On one-pass term rewriting. In L. Brim, J. Gruska, and J. Zlatusaksv, editors, Proceedings of Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 248-256. Springer Verlag, 1998.
-
(1998)
Proceedings of Mathematical Foundations of Computer Science
, Issue.1450
, pp. 248-256
-
-
F, A.1
Ülöpjurvanen, E.2
Steinby, M.3
Vágvölgy, S.4
-
12
-
-
84958742938
-
Decidable approximations of sets of descendants and sets of normal forms
-
T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In Nipkow [Nip98], pages 151-165.
-
Nipkow [Nip98]
, pp. 151-165
-
-
Genet, T.1
-
14
-
-
0347541752
-
Automates d’arbres et réécriture de termes. PhD thesis
-
F. Jacquemard. Automates d’arbres et réécriture de termes. PhD thesis, Universit é de Paris 11, 1996.
-
(1996)
Universit é De Paris
, vol.11
-
-
Jacquemard, F.1
-
17
-
-
0024144257
-
Deterministic tree pushdown automata and monadic tree rewriting systems
-
K. Salomaa. Deterministic tree pushdown automata and monadic tree rewriting systems. Journal of Comput. and Syst. Sci., 37:367-394, 1988.
-
(1988)
Journal of Comput. And Syst. Sci
, vol.37
, pp. 367-394
-
-
Salomaa, K.1
-
18
-
-
84958777198
-
Normalization of s-terms is decidable
-
J. Waldmann. Normalization of s-terms is decidable. In Nipkow [Nip98], pages 138-150.
-
In Nipkow [Nip98]
, pp. 138-150
-
-
Waldmann, J.1
|