Well quasi-orders generated by a word-shuffle rewriting

DOI10.1016/j.tcs.2007.02.007zbMath1115.68096OpenAlexW2038341356MaRDI QIDQ884464

Flavio D'Alessandro, Stefano Varricchio, Gwenaël Richomme

Publication date: 6 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.007

zbMATH Keywords

shuffleformal languageswell quasi-orders

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Well Quasi-orders in Formal Language Theory ⋮ Stefano Varricchio (1960-2008)

Cites Work

• Unnamed Item
• 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 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
• Regular solutions of language inequalities and well quasi-orders
• Well quasi-orders, unavoidable sets, and derivation systems
• STACS 2005
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Well quasi-orders generated by a word-shuffle rewriting