Pages that link to "Item:Q800086"
From MaRDI portal
The following pages link to On the complexity of iterated shuffle (Q800086):
Displaying 4 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- The Frobenius problem for the shuffle operation (Q1640009) (← links)
- Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)