Pages that link to "Item:Q4162475"
From MaRDI portal
The following pages link to Software Descriptions with Flow Expressions (Q4162475):
Displaying 33 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- On the enlargement of the class of regular languages by the shuffle closure (Q760799) (← links)
- Insertion languages (Q796994) (← links)
- On the complexity of iterated shuffle (Q800086) (← links)
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) (Q914365) (← 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)
- On describing the behavior and implementation of distributed systems (Q1143167) (← links)
- Relations of flow languages to Petri net languages (Q1158771) (← links)
- The power of synchronizing operations on strings (Q1161057) (← links)
- On universality of concurrent expressions with synchronization primitives (Q1162167) (← links)
- A P-complete language describable with iterated shuffle (Q1197969) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- Shuffle languages are in P (Q1589415) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Commutative regular languages with product-form minimal automata (Q2096583) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
- The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
- A note on specifying and verifying concurrent processes (Q2265804) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Infinite unfair shuffles and associativity (Q2373763) (← links)
- Synchronized shuffles (Q2566012) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- On the expressive power of the shuffle operator matched with intersection by regular sets (Q4331053) (← links)
- Lower Space Bounds for Accepting Shuffle Languages (Q4718896) (← links)
- Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages (Q4728280) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- Ranking and Unranking k-Subsequence Universal Words (Q6134861) (← links)