Well quasi-orders generated by a word-shuffle rewriting
type: Item
instance of: scholarly article
title: Well quasi-orders generated by a word-shuffle rewriting
zbMATH Open document ID: 1115.68096
author: Flavio D'Alessandro
author: Stefano Varricchio
author: Gwénaël Richomme
published in: Theoretical Computer Science
publication date: 2007-06-06T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5161885
zbMATH Keywords: formal languages
zbMATH Keywords: well quasi-orders
zbMATH Keywords: shuffle
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.02.007
OpenAlex ID: W2038341356
cites work: Q4452065
cites work: Well quasi-orders and context-free grammars
cites work: Well quasi-orders, unavoidable sets, and derivation systems
cites work: Well quasi-orders and regular languages
cites work: Q4231020
cites work: On regularity of context-free languages
cites work: On quasi orders of words and the confluence property
cites work: Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
cites work: Ordering by Divisibility in Abstract Algebras
cites work: On well quasi orders of free monoids
cites work: On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
cites work: Shuffle and scattered deletion closure of languages
cites work: Extending regular expressions with iterated shuffle
cites work: The theory of well-quasi-ordering: a frequently discovered concept
cites work: STACS 2005
cites work: Regular solutions of language inequalities and well quasi-orders
cites work: Q3659988
cites work: Using unavoidable set of trees to generalize Kruskal's theorem
DOI: 10.1016/J.TCS.2007.02.007
description: scientific article; zbMATH DE number 5161885