Pages that link to "Item:Q1341772"
From MaRDI portal
The following pages link to Finite-state unification automata and relational languages (Q1341772):
Displaying 9 items.
- Finite-memory automata (Q1341718) (← links)
- An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT (Q3056277) (← links)
- On Synthesis of Specifications with Arithmetic (Q3297765) (← links)
- Model checking usage policies (Q5740636) (← links)
- (Q5875386) (← links)
- Learning deterministic variable automata over infinite alphabets (Q6535973) (← links)
- On the complexity of decision problems for parameterized finite state synchronous transducers (Q6666811) (← links)