Pages that link to "Item:Q3564896"
From MaRDI portal
The following pages link to Variable Automata over Infinite Alphabets (Q3564896):
Displaying 19 items.
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Using variable automata for querying data graphs (Q483052) (← links)
- Regular and context-free nominal traces (Q530218) (← 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)
- Regular expressions for data words (Q2353403) (← links)
- Document spanners: a formal approach to information extraction (Q2796400) (← links)
- A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours (Q2811927) (← links)
- Nominal Automata for Resource Usage Control (Q2914700) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- Model checking usage policies (Q5740636) (← links)
- (Q5875386) (← links)
- Inferring Symbolic Automata (Q6135753) (← links)
- Decision procedures for sequence theories (Q6535526) (← links)
- Learning deterministic variable automata over infinite alphabets (Q6535973) (← links)
- On the complexity of decision problems for parameterized finite state synchronous transducers (Q6666811) (← links)