Computing the closure of sets of words under partial commutations (Q4645168): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-60084-1_64
+Normal rank
@@ Property / OpenAlex ID @@
+W1581738459
@@ Property / OpenAlex ID: W1581738459 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial problems of commutation and rearrangements
+Normal rank
@@ Property / cites work @@
+Q3736919
@@ Property / cites work: Q3736919 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrices de Hankel
@@ Property / cites work: Matrices de Hankel / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Regular Sets
@@ Property / cites work: Bounded Regular Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizable closures and submonoids of free partially commutative monoids
+Normal rank
@@ Property / cites work @@
+On recognizable subsets of free partially commutative monoids
+Normal rank
@@ Property / cites work @@
+ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
+Normal rank
@@ Property / cites work @@
+On regular compatibility of semi-commutations
@@ Property / cites work: On regular compatibility of semi-commutations / rank @@
+Normal rank
@@ Property / cites work @@
+Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4645168