Well quasi-orders generated by a word-shuffle rewriting
From MaRDI portal
Publication:884464
DOI10.1016/J.TCS.2007.02.007zbMATH Open1115.68096OpenAlexW2038341356MaRDI QIDQ884464FDOQ884464
Authors: Flavio D'Alessandro, Stefano Varricchio, Gwénaë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
Recommendations
Cites Work
- Title not available (Why is that?)
- The theory of well-quasi-ordering: a frequently discovered concept
- Title not available (Why is that?)
- Ordering by Divisibility in Abstract Algebras
- Extending regular expressions with iterated shuffle
- Shuffle and scattered deletion closure of languages
- On regularity of context-free languages
- Well quasi-orders and context-free grammars
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
- 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
- Using unavoidable set of trees to generalize Kruskal's theorem
- STACS 2005
- Regular solutions of language inequalities and well quasi-orders
- Well quasi-orders, unavoidable sets, and derivation systems
- Title not available (Why is that?)
Cited In (7)
- Well quasi-orders, unavoidable sets, and derivation systems
- Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
- Well Quasi-orders in Formal Language Theory
- On quasi orders of words and the confluence property
- Stefano Varricchio (1960-2008)
- Well Quasi Orders and the Shuffle Closure of Finite Sets
This page was built for publication: Well quasi-orders generated by a word-shuffle rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884464)
