The commutative closure of shuffle languages over group languages is regular
From MaRDI portal
Publication:2117662
DOI10.1007/978-3-030-79121-6_5OpenAlexW3173355999MaRDI QIDQ2117662
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2008.05420
Cites Work
- Regular languages and partial commutations
- A note on the commutative closure of star-free languages
- Permutation rewriting and algorithmic verification
- Extending regular expressions with iterated shuffle
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- The power of synchronizing operations on strings
- Shuffle languages are in P
- Automata for regular expressions with shuffle
- State complexity bounds for the commutative closure of group languages
- Commutative regular languages -- properties and state complexity
- Characterization and complexity results on jumping finite automata
- Semigroups, Presburger formulas, and languages
- On the State Complexity of the Shuffle of Regular Languages
- Efficiency of automata in semi-commutation verification techniques
- Learning Commutative Regular Languages
- Software Descriptions with Flow Expressions
- Algebraic Theory of Automata and Languages
- Bounded Regular Sets
- On Context-Free Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The commutative closure of shuffle languages over group languages is regular
