Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (Q2817401): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2424818204
@@ Property / OpenAlex ID: W2424818204 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03758
@@ Property / arXiv ID: 1606.03758 / rank @@
+Normal rank
@@ Property / cites work @@
+Normal Form on Linear Tree-to-Word Transducers
@@ Property / cites work: Normal Form on Linear Tree-to-Word Transducers / rank @@
+Normal rank
@@ Property / cites work @@
+Macro Tree Translations of Linear Size Increase are MSO Definable
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic MSO tree transducers is decidable
+Normal rank
@@ Property / cites work @@
+Tree transducers, L systems and two-way machines (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Macro tree transducers
@@ Property / cites work: Macro tree transducers / rank @@
+Normal rank
@@ Property / cites work @@
+Normalization of Sequential Top-Down Tree-to-Word Transducers
+Normal rank
@@ Property / cites work @@
+The Compressed Word Problem for Groups
@@ Property / cites work: The Compressed Word Problem for Groups / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding equivalence of top-down XML transformations in polynomial time
+Normal rank
@@ Property / cites work @@
+Equivalence of Deterministic Nested Word to Word Transducers
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2817401