scientific article; zbMATH DE number 7471718
From MaRDI portal
Publication:5028487
Authors: Joshua Moerman, Matteo Sammartino 
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/1910.11666
Title of this publication is not available (Why is that?)
Cites Work
- Learning regular sets from queries and counterexamples
- Nominal sets. Names and symmetry in computer science
- Title not available (Why is that?)
- On computability and tractability for infinite sets
- Towards nominal computation
- Nominal Kleene coalgebra
- Finite-memory automata
- Finite-memory automata with non-deterministic reassignment
- Title not available (Why is that?)
- Runtime verification based on register automata
- Stone Duality for Nominal Boolean Algebras with И
- Linear Automaton Transformations
- Finite state machines for strings over infinite alphabets
- Learning Theory
- On rational stochastic languages
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Coalgebraic constructions of canonical nondeterministic automata
- Automata theory in nominal sets
- On nominal regular languages with binders
- Freshness and Name-Restriction in Sets of Traces with Names
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- Title not available (Why is that?)
- Unambiguity in automata theory
- Automata Learning
- Learning weighted automata
- Nominal automata with name binding
- The containment problem for unambiguous register automata and unambiguous timed automata
- Learning nominal automata
- Combining black-box and white-box techniques for learning register automata
- SMT solving for functional programming over infinite structures
- LOIS: syntax and semantics
- A robust class of data languages and an application to learning
Cited In (1)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028487)
