Well quasi-orders, unavoidable sets, and derivation systems
From MaRDI portal
Publication:3421904
DOI10.1051/ita:2006019zbMath1110.68060OpenAlexW2125734985MaRDI QIDQ3421904
Flavio D'Alessandro, Stefano Varricchio
Publication date: 8 February 2007
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_3_407_0
Related Items
Well quasi-orders generated by a word-shuffle rewriting, Well Quasi-orders in Formal Language Theory, Stefano Varricchio (1960-2008)
Cites Work
- Unnamed Item
- Unnamed Item
- Well quasi-orders and context-free grammars
- On regularity of context-free languages
- Extending regular expressions with iterated shuffle
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
- Using unavoidable set of trees to generalize Kruskal's theorem
- On the regularity of languages on a binary alphabet generated by copying systems
- On well quasi orders of free monoids
- On quasi orders of words and the confluence property
- Well quasi-orders and regular languages
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
- Shuffle and scattered deletion closure of languages
- The theory of well-quasi-ordering: a frequently discovered concept
- Ordering by Divisibility in Abstract Algebras
