Classes of Tree Homomorphisms with Decidable Preservation of Regularity (Q5458355): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-78499-9_10
+Normal rank
@@ Property / OpenAlex ID @@
+W4301036742
@@ Property / OpenAlex ID: W4301036742 / rank @@
+Normal rank
@@ Property / cites work @@
+Translations on a context free grammar
@@ Property / cites work: Translations on a context free grammar / rank @@
+Normal rank
@@ Property / cites work @@
+Q4260705
@@ Property / cites work: Q4260705 / rank @@
+Normal rank
@@ Property / cites work @@
+Equational formulae with membership constraints
@@ Property / cites work: Equational formulae with membership constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Bottom-up and top-down tree transformations— a comparison
+Normal rank
@@ Property / cites work @@
+Undecidable properties of deterministic top-down tree transducers
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3058276
@@ Property / cites work: Q3058276 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4511275
@@ Property / cites work: Q4511275 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of regularity and related properties of ground normal form languages
+Normal rank
@@ Property / cites work @@
+Explicit representation of terms defined by counter examples
+Normal rank
@@ Property / cites work @@
+On the complexity of typechecking top-down XML transformations
+Normal rank