Pages that link to "Item:Q1161057"
From MaRDI portal
The following pages link to The power of synchronizing operations on strings (Q1161057):
Displaying 22 items.
- Permuting operations on strings and their relation to prime numbers (Q411832) (← links)
- Algèbre de processus et synchronisation (Q789894) (← links)
- Insertion languages (Q796994) (← 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)
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\) (Q1069312) (← links)
- Literal shuffle (Q1098321) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- A P-complete language describable with iterated shuffle (Q1197969) (← links)
- Shuffle languages are in P (Q1589415) (← links)
- The Frobenius problem for the shuffle operation (Q1640009) (← 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)
- Infinite unfair shuffles and associativity (Q2373763) (← links)
- Permuting operations on strings and the distribution of their prime numbers (Q2446830) (← links)
- Synchronized shuffles (Q2566012) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)
