The following pages link to (Q4779173):
Displaying 26 items.
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- The decision problem for some logics for finite words on infinite alphabets (Q843605) (← links)
- Classes of regular and context-free languages over countably infinite alphabets (Q1068559) (← links)
- Context-free languages over infinite alphabets (Q1386414) (← links)
- An algebraic approach to data languages and timed languages (Q1398367) (← links)
- An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) (← links)
- Morphisms on infinite alphabets, countable states automata and regular sequences (Q1674337) (← links)
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231) (← links)
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains (Q2331081) (← links)
- A note on the emptiness problem for alternating finite-memory automata (Q2437765) (← links)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- Nominal Automata for Resource Usage Control (Q2914700) (← links)
- A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions (Q2915170) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- Regular and Context-Free Pattern Languages over Small Alphabets (Q3167490) (← links)
- On Synthesis of Specifications with Arithmetic (Q3297765) (← links)
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets (Q3547014) (← links)
- Counting Multiplicity over Infinite Alphabets (Q3646259) (← links)
- (Q4972736) (← links)
- (Q5089310) (← links)
- Deadlock Detection in Linear Recursive Programs (Q5175772) (← links)
- Tree Automata over Infinite Alphabets (Q5452188) (← links)
- (Q5875386) (← links)
- Foundations of Software Science and Computation Structures (Q5899076) (← links)
- Learning deterministic variable automata over infinite alphabets (Q6535973) (← links)
