Undecidability of the equivalence of finite substitutions on regular language (Q4265533): Difference between revisions

@@ Property / author @@
-Vesa Halava
@@ Property / author: Vesa Halava / rank @@
-Normal rank
@@ Property / author @@
-Tero J.Harju
@@ Property / author: Tero J.Harju / rank @@
-Normal rank
@@ Property / author @@
+Vesa Halava
@@ Property / author: Vesa Halava / rank @@
+Normal rank
@@ Property / author @@
+Tero J.Harju
@@ Property / author: Tero J.Harju / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2038537628
@@ Property / OpenAlex ID: W2038537628 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4265634
@@ Property / cites work: Q4265634 / rank @@
+Normal rank
@@ Property / cites work @@
+Equations over finite sets of words and equivalence problems in automata theory
+Normal rank
@@ Property / cites work @@
+An undecidable problem for countable markov chains
+Normal rank
@@ Property / cites work @@
+Q4366889
@@ Property / cites work: Q4366889 / rank @@
+Normal rank
@@ Property / cites work @@
+The undecidability of some equivalence problems concerning ngsm's and finite substitutions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4265533