Extending two-variable logic on data trees with order on data values and its automata (Q5410335): Difference between revisions

@@ Property / cites work @@
+XML with data values: Typechecking revisited.
@@ Property / cites work: XML with data values: Typechecking revisited. / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Verifying Consistency of XML Specifications
+Normal rank
@@ Property / cites work @@
+Automata vs. Logics on Data Words
@@ Property / cites work: Automata vs. Logics on Data Words / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Depth Data Trees
@@ Property / cites work: Bounded Depth Data Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing Conjunctive Queries over Trees Using Schema Information
+Normal rank
@@ Property / cites work @@
+Two-variable logic on data words
@@ Property / cites work: Two-variable logic on data words / rank @@
+Normal rank
@@ Property / cites work @@
+Two-variable logic on data trees and XML reasoning
+Normal rank
@@ Property / cites work @@
+Q4791839
@@ Property / cites work: Q4791839 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Satisfiability of Two-Variable Logic over Data Words
+Normal rank
@@ Property / cites work @@
+A Decidable Temporal Logic of Repeating Values
@@ Property / cites work: A Decidable Temporal Logic of Repeating Values / rank @@
+Normal rank
@@ Property / cites work @@
+LTL with the freeze quantifier and register automata
+Normal rank
@@ Property / cites work @@
+On XML integrity constraints in the presence of DTDs
+Normal rank
@@ Property / cites work @@
+Alternating register automata on finite words and trees
+Normal rank
@@ Property / cites work @@
+Relating timed and register automata
@@ Property / cites work: Relating timed and register automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113675
@@ Property / cites work: Q3113675 / rank @@
+Normal rank
@@ Property / cites work @@
+Variable Automata over Infinite Alphabets
@@ Property / cites work: Variable Automata over Infinite Alphabets / rank @@
+Normal rank
@@ Property / cites work @@
+Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete
+Normal rank
@@ Property / cites work @@
+Finite-memory automata
@@ Property / cites work: Finite-memory automata / rank @@
+Normal rank
@@ Property / cites work @@
+Feasible Automata for Two-Variable Logic with Successor on Data Words
+Normal rank
@@ Property / cites work @@
+Safety alternating automata on data words
@@ Property / cites work: Safety alternating automata on data words / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Two Variables and Two Successors
@@ Property / cites work: Two Variables and Two Successors / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411812
@@ Property / cites work: Q4411812 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite state machines for strings over infinite alphabets
+Normal rank
@@ Property / cites work @@
+Two-Variable Logic with Two Order Relations
@@ Property / cites work: Two-Variable Logic with Two Order Relations / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
+Normal rank
@@ Property / cites work @@
+Automated Deduction – CADE-20
@@ Property / cites work: Automated Deduction – CADE-20 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q130860774
@@ Property / Wikidata QID: Q130860774 / rank @@
+Normal rank