The following pages link to Two-variable logic on data words (Q2946646):
Displayed 50 items.
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) (Q288804) (← links)
- Metric propositional neighborhood logic with an equivalence relation (Q329414) (← links)
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Walking on data words (Q504989) (← links)
- Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
- On regular paths with counting and data tests (Q1744429) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- On pebble automata for data languages with decidable emptiness problem (Q1959427) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- Streamable regular transductions (Q2286735) (← links)
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains (Q2331081) (← links)
- Regular expressions for data words (Q2353403) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- On Freeze LTL with Ordered Attributes (Q2811345) (← links)
- A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours (Q2811927) (← links)
- Expressiveness of Hybrid Temporal Logic on Data Words (Q2825412) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- Algorithmic Nominal Game Semantics (Q3000592) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Weighted Register Automata and Weighted Logic on Data Words (Q3179411) (← links)
- Future-Looking Logics on Data Words and Trees (Q3182936) (← links)
- On Pebble Automata for Data Languages with Decidable Emptiness Problem (Q3182968) (← links)
- Beyond Knowing That: A New Generation of Epistemic Logics (Q3299590) (← links)
- Playing with Repetitions in Data Words Using Energy Games (Q3300789) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Q3451103) (← links)
- Algorithmic Analysis of Array-Accessing Programs (Q3644742) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Q4640038) (← links)
- Solving Infinite Games in the Baire Space (Q5038566) (← links)
- (Q5089315) (← links)
- The Complexity of Flat Freeze LTL (Q5111647) (← links)
- (Q5136335) (← links)
- Learning Transparent Data Automata (Q5166760) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$ (Q5738989) (← links)
- Optimal run problem for weighted register automata (Q5919052) (← links)
- Abstraction refinement and antichains for trace inclusion of infinite state systems (Q5919079) (← links)
- A Note on C² Interpreted over Finite Data-Words (Q6060103) (← links)