Variable automata over infinite alphabets
From MaRDI portal
Cites work
- A new approach to abstract syntax with variable binding
- A robust class of data languages and an application to learning
- An Evaluation of Automata Algorithms for String Analysis
- Assume, guarantee or repair
- Automata theory in nominal sets
- Automatic verification of recursive procedures with one integer parameter.
- Finite-memory automata
- Finite-memory automata with non-deterministic reassignment
- Finite-state unification automata and relational languages
- scientific article; zbMATH DE number 1834677 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Inferring Symbolic Automata
- Learning deterministic variable automata over infinite alphabets
- Learning nominal automata
- Learning regular sets from queries and counterexamples
- Learning symbolic automata
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Residuality and learning for nondeterministic nominal automata
- Rewriting Systems with Data
- Symbolic automata: the toolkit
- Symbolic register automata
- The learnability of symbolic automata
- Towards nominal computation
- Two-variable logic on data trees and XML reasoning
- Variable automata over infinite alphabets
This page was built for publication: Variable automata over infinite alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913624)
