Well quasi-orders generated by a word-shuffle rewriting
From MaRDI portal
(Redirected from Publication:884464)
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1259068 (Why is no real title available?)
- scientific article; zbMATH DE number 2040909 (Why is no real title available?)
- Another generalization of Higman's well quasi order result on ^*
- Extending regular expressions with iterated shuffle
- On quasi orders of words and the confluence property
- On regularity of context-free languages
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
- On well quasi orders of free monoids
- Ordering by Divisibility in Abstract Algebras
- Regular solutions of language inequalities and well quasi-orders
- STACS 2005
- Shuffle and scattered deletion closure of languages
- The theory of well-quasi-ordering: a frequently discovered concept
- Using unavoidable set of trees to generalize Kruskal's theorem
- Well quasi-orders and context-free grammars
- Well quasi-orders and regular languages
- Well quasi-orders, unavoidable sets, and derivation systems
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 ^*
- 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)