The following pages link to Shuffle languages are in P (Q1589415):
Displaying 13 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Tree shuffle (Q389936) (← links)
- Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking (Q391129) (← links)
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← 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)
- On the expressive power of the shuffle operator matched with intersection by regular sets (Q4331053) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
