An algorithmic approach to the problem of a semiretract base (Q861270): Difference between revisions

@@ Property / cites work @@
+Semiretracts of a free monoid
@@ Property / cites work: Semiretracts of a free monoid / rank @@
+Normal rank
@@ Property / cites work @@
+Code properties of minimal generating sets of retracts and semiretracts
+Normal rank
@@ Property / cites work @@
+The intersection of retracts of \(A^{*}\)
@@ Property / cites work: The intersection of retracts of \(A^{*}\) / rank @@
+Normal rank
@@ Property / cites work @@
+The lattice of semiretracts of a free monoid
@@ Property / cites work: The lattice of semiretracts of a free monoid / rank @@
+Normal rank
@@ Property / cites work @@
+Q4430300
@@ Property / cites work: Q4430300 / rank @@
+Normal rank
@@ Property / cites work @@
+The poset of retracts of a free monoid
@@ Property / cites work: The poset of retracts of a free monoid / rank @@
+Normal rank
@@ Property / cites work @@
+Semiretracts -- a counterexample and some results.
+Normal rank
@@ Property / cites work @@
+Fixed languages and the adult languages of ol schemest<sup>†</sup>
+Normal rank
@@ Property / cites work @@
+Expanded subalphabets in the theories of languages and semigroups†
+Normal rank
@@ Property / cites work @@
+Q3853827
@@ Property / cites work: Q3853827 / rank @@
+Normal rank