Pages that link to "Item:Q3926067"
From MaRDI portal
The following pages link to Shuffle languages, Petri nets, and context-sensitive grammars (Q3926067):
Displaying 17 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- On the complexity of iterated shuffle (Q800086) (← 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)
- Axiomatizing shuffle and concatenation in languages (Q1383153) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Infinite unfair shuffles and associativity (Q2373763) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- Synchronized shuffles (Q2566012) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- Algorithmic Analysis of Array-Accessing Programs (Q3644742) (← links)
- Lower Space Bounds for Accepting Shuffle Languages (Q4718896) (← links)
- A Note on Multidimensional Dyck Languages (Q5414970) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
