The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922): Difference between revisions

@@ Property / author @@
-Paavo Turakainen
@@ Property / author: Paavo Turakainen / rank @@
-Normal rank
@@ Property / author @@
+Paavo Turakainen
@@ Property / author: Paavo Turakainen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
+Normal rank
@@ Property / cites work @@
+Cardinality problems of compositions of morphisms and inverse morphisms
+Normal rank
@@ Property / cites work @@
+The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
+Normal rank
@@ Property / cites work @@
+Equations over finite sets of words and equivalence problems in automata theory
+Normal rank
@@ Property / cites work @@
+Q3736916
@@ Property / cites work: Q3736916 / rank @@
+Normal rank
@@ Property / cites work @@
+On the equivalence of some transductions involving letter to letter morphisms on regular languages
+Normal rank
@@ Property / cites work @@
+Q4140407
@@ Property / cites work: Q4140407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4294173
@@ Property / cites work: Q4294173 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank
@@ Property / cites work @@
+On some transducer equivalence problems for families of languages
+Normal rank