The commutative closure of shuffle languages over group languages is regular (Q2117662): Difference between revisions

@@ Property / cites work @@
+Permutation rewriting and algorithmic verification
+Normal rank
@@ Property / cites work @@
+Automata for regular expressions with shuffle
@@ Property / cites work: Automata for regular expressions with shuffle / rank @@
+Normal rank
@@ Property / cites work @@
+On the State Complexity of the Shuffle of Regular Languages
+Normal rank
@@ Property / cites work @@
+Q4048566
@@ Property / cites work: Q4048566 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4807824
@@ Property / cites work: Q4807824 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5003075
@@ Property / cites work: Q5003075 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of automata in semi-commutation verification techniques
+Normal rank
@@ Property / cites work @@
+Characterization and complexity results on jumping finite automata
+Normal rank
@@ Property / cites work @@
+Q5208373
@@ Property / cites work: Q5208373 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4590910
@@ Property / cites work: Q4590910 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Regular Sets
@@ Property / cites work: Bounded Regular Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
+Normal rank
@@ Property / cites work @@
+Learning Commutative Regular Languages
@@ Property / cites work: Learning Commutative Regular Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Regular languages and partial commutations
@@ Property / cites work: Regular languages and partial commutations / rank @@
+Normal rank
@@ Property / cites work @@
+Commutative regular languages -- properties and state complexity
+Normal rank
@@ Property / cites work @@
+State complexity bounds for the commutative closure of group languages
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic Theory of Automata and Languages
@@ Property / cites work: Algebraic Theory of Automata and Languages / rank @@
+Normal rank
@@ Property / cites work @@
+The power of synchronizing operations on strings
@@ Property / cites work: The power of synchronizing operations on strings / rank @@
+Normal rank
@@ Property / cites work @@
+Extending regular expressions with iterated shuffle
+Normal rank
@@ Property / cites work @@
+Shuffle languages are in P
@@ Property / cites work: Shuffle languages are in P / rank @@
+Normal rank
@@ Property / cites work @@
+Q4140399
@@ Property / cites work: Q4140399 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4094357
@@ Property / cites work: Q4094357 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the commutative closure of star-free languages
+Normal rank
@@ Property / cites work @@
+On Context-Free Languages
@@ Property / cites work: On Context-Free Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3769981
@@ Property / cites work: Q3769981 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5547597
@@ Property / cites work: Q5547597 / rank @@
+Normal rank
@@ Property / cites work @@
+Software Descriptions with Flow Expressions
@@ Property / cites work: Software Descriptions with Flow Expressions / rank @@
+Normal rank