The equivalence of deterministic gsm replications onQ-rational languages is decidable (Q3779775): Difference between revisions

@@ Property / cites work @@
+Reset machines
@@ Property / cites work: Reset machines / rank @@
+Normal rank
@@ Property / cites work @@
+AFL with the semilinear property
@@ Property / cites work: AFL with the semilinear property / rank @@
+Normal rank
@@ Property / cites work @@
+Syntactic operators on full semiAFLs
@@ Property / cites work: Syntactic operators on full semiAFLs / rank @@
+Normal rank
@@ Property / cites work @@
+One way finite visit automata
@@ Property / cites work: One way finite visit automata / rank @@
+Normal rank
@@ Property / cites work @@
+DST mappings of languages and related problems
@@ Property / cites work: 2DST mappings of languages and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4155837
@@ Property / cites work: Q4155837 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Automata and Stochastic Languages
@@ Property / cites work: Generalized Automata and Stochastic Languages / rank @@
+Normal rank
@@ Property / cites work @@
+On some transducer equivalence problems for families of languages
+Normal rank