Well Quasi-orders in Formal Language Theory
From MaRDI portal
Publication:3533001
DOI10.1007/978-3-540-85780-8_6zbMath1161.68024OpenAlexW1835540665MaRDI QIDQ3533001
Stefano Varricchio, Flavio D'Alessandro
Publication date: 30 October 2008
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_6
Related Items (3)
Well quasi-orders arising from finite ordered semigroups ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Stefano Varricchio (1960-2008)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well quasi-orders and context-free grammars
- On regularity of context-free languages
- On regularity of languages generated by copying systems
- Well quasi-orders generated by a word-shuffle rewriting
- 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
- On the rational subsets of the free group
- 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
- Well Quasi Orders and the Shuffle Closure of Finite Sets
- STACS 2005
- Developments in Language Theory
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Well Quasi-orders in Formal Language Theory
