Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
From MaRDI portal
Publication:6070751
DOI10.1142/s0129054123430037OpenAlexW3138173284MaRDI QIDQ6070751
Publication date: 24 November 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054123430037
finite automataclosure propertiescommutative languagesshuffle closureiterated shuffleregularity-preserving operationspositive varietiessuperalphabet closure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shuffled languages -- representation and recognition
- The expressive power of the shuffle product
- On regularity of context-free languages
- On the enlargement of the class of regular languages by the shuffle closure
- On the complexity of iterated shuffle
- Commutative one-counter languages are regular
- State complexity of projection on languages recognized by permutation automata and commuting letters
- Extending regular expressions with iterated shuffle
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- Flow languages equal recursively enumerable languages
- The complexity of logical theories
- The power of synchronizing operations on strings
- The universe problem for unrestricted flow languages
- Variétés de langages et opérations
- Modeling literal morphisms by shuffle
- Shuffle languages are in P
- Automata for regular expressions with shuffle
- On the complexity and decidability of some problems involving shuffle
- Shuffle on positive varieties of languages
- String shuffle: circuits and graphs
- Regularity conditions for iterated shuffle on commutative regular languages
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
- Commutative regular languages -- properties and state complexity
- Constrained synchronization and commutativity
- Characterization and complexity results on jumping finite automata
- Unshuffling a square is NP-hard
- Location automata for synchronised shuffle expressions
- The Shuffle Product: New Research Directions
- On the State Complexity of the Shuffle of Regular Languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- On the Chinese Remainder Theorem
- Shuffle languages, Petri nets, and context-sensitive grammars
- Process Algebra
- Software Descriptions with Flow Expressions
- An approach to software system behavior description
- Algebraic Theory of Automata and Languages
- On finite monoids having only trivial subgroups
- Commutative Positive Varieties of Languages
- A Hierarchy of Languages with Catenation and Shuffle
- Properties of Languages with Catenation and Shuffle
- Bounded Regular Sets
- Permutation automata
- The loop complexity of pure-group events
This page was built for publication: Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
