An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831): Difference between revisions

@@ Property / cites work @@
+Q3859267
@@ Property / cites work: Q3859267 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5557748
@@ Property / cites work: Q5557748 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5515450
@@ Property / cites work: Q5515450 / rank @@
+Normal rank
@@ Property / cites work @@
+Rational sets in commutative monoids
@@ Property / cites work: Rational sets in commutative monoids / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Regular Sets
@@ Property / cites work: Bounded Regular Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4155837
@@ Property / cites work: Q4155837 / rank @@
+Normal rank