Equivalence of finite-valued tree transducers is decidable (Q4301635): Difference between revisions

@@ Property / cites work @@
+Attribute grammars and recursive program schemes. I. II
+Normal rank
@@ Property / cites work @@
+The equivalence of finite valued transducers (on HDT0L languages) is decidable
+Normal rank
@@ Property / cites work @@
+Q3906457
@@ Property / cites work: Q3906457 / rank @@
+Normal rank
@@ Property / cites work @@
+Sur les rélations rationnelles entre monoides libres
+Normal rank
@@ Property / cites work @@
+On the finite degree of ambiguity of finite tree automata
+Normal rank
@@ Property / cites work @@
+Single-valuedness of tree transducers is decidable in polynomial time
+Normal rank
@@ Property / cites work @@
+Decomposing Finite-Valued Transducers and Deciding Their Equivalence
+Normal rank
@@ Property / cites work @@
+On the lengths of values in a finite transducer
@@ Property / cites work: On the lengths of values in a finite transducer / rank @@
+Normal rank
@@ Property / cites work @@
+On the valuedness of finite transducers
@@ Property / cites work: On the valuedness of finite transducers / rank @@
+Normal rank
@@ Property / cites work @@
+On the degree of ambiguity of finite automata
@@ Property / cites work: On the degree of ambiguity of finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4185831
@@ Property / cites work: Q4185831 / rank @@
+Normal rank