Pages that link to "Item:Q1338899"
From MaRDI portal
The following pages link to Well quasi-orders and regular languages (Q1338899):
Displaying 19 items.
- Well quasi-orders and context-free grammars (Q703570) (← links)
- On regularity of context-free languages (Q759489) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- On the regularity of languages on a binary alphabet generated by copying systems (Q1205714) (← links)
- On well quasi orders of free monoids (Q1275465) (← links)
- On well quasiordering of finite languages (Q1356526) (← links)
- On the generalization of Higman and Kruskal's theorems to regular languages and rational trees (Q1567204) (← links)
- Well-quasi-orders and regular \(\omega\)-languages (Q1882913) (← links)
- Well quasi ordering finite posets and formal languages (Q1898732) (← links)
- Stefano Varricchio (1960-2008) (Q2267786) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Regular solutions of language inequalities and well quasi-orders (Q2581271) (← links)
- Well quasi-orders, unavoidable sets, and derivation systems (Q3421904) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- (Q5089207) (← links)
- Automata, Languages and Programming (Q5466521) (← links)
- Fundamentals of Computation Theory (Q5900810) (← links)
- Antichains algorithms for the inclusion problem between \(\omega\)-VPL (Q6535360) (← links)
- Language inclusion algorithms as complete abstract interpretations (Q6536285) (← links)
