论文信息 - Using Unavoidable Set of Trees to Generalize Kruskal's Theorem - 字舞流文

Using Unavoidable Set of Trees to Generalize Kruskal's Theorem

Presentation d'une application simple, consistant a demontrer la terminaison d'un systeme de reecriture particulier, compose d'une regle unique

Laurence Puel | L. Puel | Laurence Puel

[1] Joseph B. Kruskal,et al. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.

[2] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[5] David Haussler,et al. On Regularity of Context-Free Languages , 1983, Theor. Comput. Sci..

[6] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[7] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .