Pages that link to "Item:Q3533001"
From MaRDI portal
The following pages link to Well Quasi-orders in Formal Language Theory (Q3533001):
Displaying 15 items.
- Well quasi-orders and context-free grammars (Q703570) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\) (Q1069312) (← links)
- On well quasi orders of free monoids (Q1275465) (← links)
- Well quasi-orders and regular languages (Q1338899) (← links)
- On well quasiordering of finite languages (Q1356526) (← links)
- Well-quasi-orders and regular \(\omega\)-languages (Q1882913) (← links)
- Well quasi ordering finite posets and formal languages (Q1898732) (← links)
- Well quasi-orders arising from finite ordered semigroups (Q2163999) (← links)
- Stefano Varricchio (1960-2008) (Q2267786) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- A property of sentences that define quasi-order (Q2531921) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Automata, Languages and Programming (Q5466521) (← links)
- Characterization of ordered semigroups generating well quasi-orders of words (Q6580076) (← links)
