Let G be a context-free grammar and let L be the language of all the words derived from any variable of G. We prove the following generalization of Higman's theorem: any division order on L is a well quasi-order on L. We also give applications of this result to some quasi-orders associated with unitary grammars. © Springer-Verlag Berlin Heidelberg 2003
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
AbstractWe investigate the confluence property, that is, the property of a language to contain, for ...
AbstractBy means of constructing suitable well quasi-orders of free monoids we prove that all maxima...
Let G be a context-free grammar and let L be the language of all the words derived from any variable...
AbstractLet G be a context-free grammar and let L be the language of all the words derived from any ...
AbstractLet G be a context-free grammar and let L be the language of all the words derived from any ...
The concept of well quasi-order is a generalization of the classical notion of well order and plays ...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
AbstractWe present another generalization of Higman's result ([2]) that the subsequence embedding re...
AbstractWe present another generalization of Higman's result ([2]) that the subsequence embedding re...
In this paper we give new extensions and generalizations of the Higman and Kruskal theorems. We star...
In this paper we give new extensions and generalizations of the Higman and Kruskal theorems. We star...
In this paper we give new extensions and generalizations of the Higman and Kruskal theorems. We star...
In this paper we give new extensions and generalizations of the Higman and Kruskal theorems. We star...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
AbstractWe investigate the confluence property, that is, the property of a language to contain, for ...
AbstractBy means of constructing suitable well quasi-orders of free monoids we prove that all maxima...
Let G be a context-free grammar and let L be the language of all the words derived from any variable...
AbstractLet G be a context-free grammar and let L be the language of all the words derived from any ...
AbstractLet G be a context-free grammar and let L be the language of all the words derived from any ...
The concept of well quasi-order is a generalization of the classical notion of well order and plays ...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
AbstractWe present another generalization of Higman's result ([2]) that the subsequence embedding re...
AbstractWe present another generalization of Higman's result ([2]) that the subsequence embedding re...
In this paper we give new extensions and generalizations of the Higman and Kruskal theorems. We star...
In this paper we give new extensions and generalizations of the Higman and Kruskal theorems. We star...
In this paper we give new extensions and generalizations of the Higman and Kruskal theorems. We star...
In this paper we give new extensions and generalizations of the Higman and Kruskal theorems. We star...
AbstractThe paper investigates down-sets associated to well quasi orders. Of particular language-the...
AbstractWe investigate the confluence property, that is, the property of a language to contain, for ...
AbstractBy means of constructing suitable well quasi-orders of free monoids we prove that all maxima...