Using unavoidable set of trees to generalize Kruskal's theorem
From MaRDI portal
DOI10.1016/S0747-7171(89)80035-5zbMATH Open0676.06003MaRDI QIDQ1122597FDOQ1122597
Authors: Laurence Puel 
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Recommendations
Trees (05C05) Partial orders, general (06A06) Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65)
Cites Work
- Orderings for term-rewriting systems
- The theory of well-quasi-ordering: a frequently discovered concept
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Ordering by Divisibility in Abstract Algebras
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- On regularity of context-free languages
Cited In (15)
- Well quasi-orders, unavoidable sets, and derivation systems
- On unavoidability of trees with \(k\) leaves
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- Well Quasi-orders in Formal Language Theory
- Unavoidable languages, cuts and innocent sets of words
- Generalizing Kruskal's theorem to pairs of cohabitating trees
- Well quasi-orders generated by a word-shuffle rewriting
- Linearizing well quasi-orders and bounding the length of bad sequences
- Inventories of unavoidable languages and the word-extension conjecture
- Embedding with patterns and associated recursive path ordering
- Well rewrite orderings and well quasi-orderings
- A comparison of well-quasi orders on trees
- Complexity bounds for some finite forms of Kruskal's theorem
- Title not available (Why is that?)
- Kruskal's tree theorem for acyclic term graphs
This page was built for publication: Using unavoidable set of trees to generalize Kruskal's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122597)
