Let I be a finite set of words and ⇒I* be the derivation relation generated by the set of productions {ε → u | u ∈ I}. Let LI ε be the set of words u such that ε ⇒I* u. We prove that the set I is unavoidable if and only if the relation ⇒I* is a well quasi-order on the set LI ε. This result generalizes a theorem of [7]. Further generalizations are investigated. © Springer-Verlag Berlin Heidelberg 2004
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (w...
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (w...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
AbstractGiven a set I of words, the set L⊢Iϵ of all words obtained by the shuffle of (copies of) wor...
Given a set I of words, the set L⊢Iε{lunate} of all words obtained by the shuffle of (copies of) wor...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
A quasi-order is a reflexive and transitive relation. A quasi-ordered set (Q, ⩽) consists of a set Q...
AbstractGiven a set I of words, the set L⊢Iϵ of all words obtained by the shuffle of (copies of) wor...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
AbstractWe present another generalization of Higman's result ([2]) that the subsequence embedding re...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
Given a set I of words, the set L⊢ I ∈ of all words obtained by the shuffle of (copies of) words of ...
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (w...
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (w...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
AbstractGiven a set I of words, the set L⊢Iϵ of all words obtained by the shuffle of (copies of) wor...
Given a set I of words, the set L⊢Iε{lunate} of all words obtained by the shuffle of (copies of) wor...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
A quasi-order is a reflexive and transitive relation. A quasi-ordered set (Q, ⩽) consists of a set Q...
AbstractGiven a set I of words, the set L⊢Iϵ of all words obtained by the shuffle of (copies of) wor...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
AbstractWe present another generalization of Higman's result ([2]) that the subsequence embedding re...
This article describes well quasi orders as a category, focusing on limits and colimits. In particul...
Given a set I of words, the set L⊢ I ∈ of all words obtained by the shuffle of (copies of) words of ...
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (w...
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (w...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...