Software Descriptions with Flow Expressions

Cited in

(44)

Extending regular expressions with iterated shuffle
Another generalization of Higman's well quasi order result on ^*
Literal shuffle
The equational theory of pomsets
On describing the behavior and implementation of distributed systems
Relations of flow languages to Petri net languages
The power of synchronizing operations on strings
On universality of concurrent expressions with synchronization primitives
A P-complete language describable with iterated shuffle
\(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs
Shuffle languages are in P
String shuffle: circuits and graphs
Commutative regular languages with product-form minimal automata
State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages
Regularity conditions for iterated shuffle on commutative regular languages
The commutative closure of shuffle languages over group languages is regular
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
A note on specifying and verifying concurrent processes
Characterization and complexity results on jumping finite automata
Infinite unfair shuffles and associativity
Synchronized shuffles
Unshuffling a square is NP-hard
The Shuffle Product: New Research Directions
Shuffled languages -- representation and recognition
On the expressive power of the shuffle operator matched with intersection by regular sets
Lower Space Bounds for Accepting Shuffle Languages
Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
Ranking and Unranking k-Subsequence Universal Words
Longest Common Subsequence with Gap Constraints
Subsequences in bounded ranges: matching and analysis problems
Combinatorial algorithms for subsequence matching: a survey
k-universality of regular languages
Subsequences with generalised gap constraints: upper and lower complexity bounds
k-universality of regular languages revisited
The n-ary initial literal and literal shuffle
\(k\)-universality of regular languages
Longest common subsequence with gap constraints
Subsequence matching and analysis problems for formal languages
Linear time subsequence and supersequence regex matching
On the enlargement of the class of regular languages by the shuffle closure
Insertion languages
On the complexity of iterated shuffle
Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)

This page was built for publication: Software Descriptions with Flow Expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162475)