Pages that link to "Item:Q2581271"
From MaRDI portal
The following pages link to Regular solutions of language inequalities and well quasi-orders (Q2581271):
Displaying 11 items.
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages (Q1748357) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- Language equations (Q2074222) (← links)
- Well quasi-orders arising from finite ordered semigroups (Q2163999) (← links)
- Rational subsets and submonoids of wreath products. (Q2347806) (← links)
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) (Q2437851) (← links)
- Computing by commuting. (Q2490820) (← links)
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (Q3195698) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- Characterization of ordered semigroups generating well quasi-orders of words (Q6580076) (← links)
