Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037): Difference between revisions

@@ Property / describes a project that uses @@
+Ltur
@@ Property / describes a project that uses: Ltur / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Datalog LITE
@@ Property / describes a project that uses: Datalog LITE / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2009.03.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2090802466
@@ Property / OpenAlex ID: W2090802466 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Equivalence of Finite Tree Automata
@@ Property / cites work: Deciding Equivalence of Finite Tree Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Haskell overloading is DEXPTIME-complete
@@ Property / cites work: Haskell overloading is DEXPTIME-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Automata for XML -- a survey
@@ Property / cites work: Automata for XML -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Typechecking for XML transformers
@@ Property / cites work: Typechecking for XML transformers / rank @@
+Normal rank
@@ Property / cites work @@
+Schema-Guided Induction of Monadic Queries
@@ Property / cites work: Schema-Guided Induction of Monadic Queries / rank @@
+Normal rank
@@ Property / cites work @@
+Rewriting Techniques and Applications
@@ Property / cites work: Rewriting Techniques and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+One-unambiguous regular languages
@@ Property / cites work: One-unambiguous regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimization of XML schemas and tree automata for unranked trees
+Normal rank
@@ Property / cites work @@
+Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
+Normal rank
@@ Property / cites work @@
+Database Theory - ICDT 2005
@@ Property / cites work: Database Theory - ICDT 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3146939
@@ Property / cites work: Q3146939 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Datalog LITE
@@ Property / cites work: Datalog LITE / rank @@
+Normal rank
@@ Property / cites work @@
+LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
+Normal rank
@@ Property / cites work @@
+Regular expressions into finite automata
@@ Property / cites work: Regular expressions into finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q3902489
@@ Property / cites work: Q3902489 / rank @@
+Normal rank
@@ Property / cites work @@
+Streaming tree automata
@@ Property / cites work: Streaming tree automata / rank @@
+Normal rank
@@ Property / cites work @@
+Marrying Words and Trees
@@ Property / cites work: Marrying Words and Trees / rank @@
+Normal rank