The following pages link to (Q4140399):
Displaying 15 items.
- On the complexity of iterated shuffle (Q800086) (← links)
- Langages infinitaires et produit de mixage (Q1061496) (← links)
- Extending regular expressions with iterated shuffle (Q1063422) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- Observations on the complexity of regular expression problems (Q1149249) (← links)
- The power of synchronizing operations on strings (Q1161057) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
- Infinite unfair shuffles and associativity (Q2373763) (← links)
- Synchronized shuffles (Q2566012) (← links)
- On recognising words that are squares for the shuffle product (Q2699216) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- There is no complete axiom system for shuffle expressions (Q4718894) (← links)
- Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages (Q4728280) (← links)
- (Q5002800) (← links)
