Pages that link to "Item:Q1853115"
From MaRDI portal
The following pages link to A logical characterization of data languages. (Q1853115):
Displaying 16 items.
- A succinct canonical register automaton model (Q478388) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- An algebraic approach to data languages and timed languages (Q1398367) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Nominal Automata for Resource Usage Control (Q2914700) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
- CLASS COUNTING AUTOMATA ON DATAWORDS (Q3016221) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Weighted Register Automata and Weighted Logic on Data Words (Q3179411) (← links)
- Weight Assignment Logic (Q3451120) (← links)
- Counting Multiplicity over Infinite Alphabets (Q3646259) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Optimal run problem for weighted register automata (Q5919052) (← links)
- A Note on C² Interpreted over Finite Data-Words (Q6060103) (← links)
