Pages that link to "Item:Q1063422"
From MaRDI portal
The following pages link to Extending regular expressions with iterated shuffle (Q1063422):
Displayed 24 items.
- Tree shuffle (Q389936) (← links)
- On the complexity of iterated shuffle (Q800086) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- Infinite hierarchy of shuffle expressions over a finite alphabet (Q918713) (← links)
- Extending regular expressions with iterated shuffle (Q1063422) (← links)
- Nesting of shuffle closure is important (Q1096398) (← links)
- Infinite hierarchy of expressions containing shuffle closure operator (Q1107331) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- A P-complete language describable with iterated shuffle (Q1197969) (← links)
- Shuffle and scattered deletion closure of languages (Q1575737) (← links)
- Shuffle languages are in P (Q1589415) (← links)
- The Frobenius problem for the shuffle operation (Q1640009) (← links)
- The regular-language semantics of second-order idealized ALGOL (Q1884909) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES (Q3021987) (← links)
- Well quasi-orders, unavoidable sets, and derivation systems (Q3421904) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- Lower Space Bounds for Accepting Shuffle Languages (Q4718896) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- On (left) partial shuffle (Q6183610) (← links)