Software Descriptions with Flow Expressions

Cited in

(43)

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

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)