On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata (Q2453381): Difference between revisions

@@ Property / DOI @@
-.1007/s10958-010-9972-3
@@ Property / DOI: 10.1007/s10958-010-9972-3 / rank @@
-Normal rank
@@ Property / author @@
+Dmitriĭ Nikolaevich Babin
@@ Property / author: Dmitriĭ Nikolaevich Babin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10958-010-9972-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2083828733
@@ Property / OpenAlex ID: W2083828733 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4272118
@@ Property / cites work: Q4272118 / rank @@
+Normal rank
@@ Property / cites work @@
+On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
+Normal rank
@@ Property / cites work @@
+Q3980812
@@ Property / cites work: Q3980812 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5557947
@@ Property / cites work: Q5557947 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10958-010-9972-3
@@ Property / DOI: 10.1007/S10958-010-9972-3 / rank @@
+Normal rank