scientific article; zbMATH DE number 7471718
From MaRDI portal
Publication:5028487
Matteo Sammartino, Joshua Moerman
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/1910.11666
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- Coalgebraic constructions of canonical nondeterministic automata
- Learning regular sets from queries and counterexamples
- Finite-memory automata
- The containment problem for unambiguous register automata and unambiguous timed automata
- Combining black-box and white-box techniques for learning register automata
- Nominal Sets
- Automata theory in nominal sets
- On Nominal Regular Languages with Binders
- A Robust Class of Data Languages and an Application to Learning
- Towards nominal computation
- Learning Weighted Automata
- Nominal Automata with Name Binding
- Freshness and Name-Restriction in Sets of Traces with Names
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
- Stone Duality for Nominal Boolean Algebras with И
- Linear Automaton Transformations
- Nominal Kleene Coalgebra
- Learning Theory
- On computability and tractability for infinite sets
- Automata Learning
- Finite state machines for strings over infinite alphabets
- Runtime Verification Based on Register Automata
- LOIS: syntax and semantics
- Learning nominal automata
- Unambiguity in Automata Theory
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
This page was built for publication:
