The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933): Difference between revisions

@@ Property / cites work @@
+A proof of Ehrenfeucht's conjecture
@@ Property / cites work: A proof of Ehrenfeucht's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic two-tape automata
+Normal rank
@@ Property / cites work @@
+Systems of equations over a free monoid and Ehrenfeucht's conjecture
+Normal rank
@@ Property / cites work @@
+The equivalence of finite valued transducers (on HDT0L languages) is decidable
+Normal rank
@@ Property / cites work @@
+Remarks on blind and partially blind one-way multicounter machines
+Normal rank
@@ Property / cites work @@
+The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
+Normal rank
@@ Property / cites work @@
+A note on finite-valued and finitely ambiguous transducers
+Normal rank
@@ Property / cites work @@
+Undecidability of the equivalence of finite substitutions on regular language
+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 @@
+Sur les rélations rationnelles entre monoides libres
+Normal rank
@@ Property / cites work @@
+On some transducer equivalence problems for families of languages
+Normal rank
@@ Property / cites work @@
+The undecidability of some equivalence problems concerning ngsm's and finite substitutions
+Normal rank
@@ Property / cites work @@
+Decomposing Finite-Valued Transducers and Deciding Their Equivalence
+Normal rank