Regularity Conditions for Iterated Shuffle on Commutative Regular Languages

finite automata closure properties commutative languages shuffle closure iterated shuffle regularity-preserving operations positive varieties superalphabet closure

Mathematics Subject Classification ID

Theory of computing (68Qxx) Semigroups (20Mxx) Computer science (68-XX)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Title not available (Why is that?)
On finite monoids having only trivial subgroups
Process Algebra
Title not available (Why is that?)
Shuffle languages are in P
Shuffle on positive varieties of languages
Shuffled languages -- representation and recognition
Shuffle languages, Petri nets, and context-sensitive grammars
Software Descriptions with Flow Expressions
An approach to software system behavior description
The expressive power of the shuffle product
On the complexity of iterated shuffle
Extending regular expressions with iterated shuffle
Title not available (Why is that?)
Algebraic Theory of Automata and Languages
An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
The complexity of logical theories
Commutative regular languages -- properties and state complexity
Bounded Regular Sets
The power of synchronizing operations on strings
Unshuffling a square is NP-hard
Variétés de langages et opérations
On regularity of context-free languages
Permutation automata
Title not available (Why is that?)
Modeling literal morphisms by shuffle
The Shuffle Product: New Research Directions
Flow languages equal recursively enumerable languages
On the State Complexity of the Shuffle of Regular Languages
The loop complexity of pure-group events
On the enlargement of the class of regular languages by the shuffle closure
On the complexity and decidability of some problems involving shuffle
Commutative one-counter languages are regular
State complexity of projection on languages recognized by permutation automata and commuting letters
The universe problem for unrestricted flow languages
On the Chinese Remainder Theorem
Title not available (Why is that?)
A hierarchy of languages with catenation and shuffle
Characterization and complexity results on jumping finite automata
Automata for regular expressions with shuffle
On the shuffle of star-free languages
String shuffle: circuits and graphs
Extensions to minimal synchronizing words
Constrained synchronization and commutativity
Title not available (Why is that?)
Regularity conditions for iterated shuffle on commutative regular languages
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
Commutative Positive Varieties of Languages
Location automata for synchronised shuffle expressions
Properties of Languages with Catenation and Shuffle

Cited In (4)

Regularity conditions for iterated shuffle on commutative regular languages
On the enlargement of the class of regular languages by the shuffle closure
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
Title not available (Why is that?)

This page was built for publication: Regularity Conditions for Iterated Shuffle on Commutative Regular Languages

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