Residuality and learning for nondeterministic nominal automata

MaRDI QIDQ5028487zbMATH OpenFDO

Authors Joshua Moerman, Matteo Sammartino

Publication date 9 February 2022

Full work available at URL https://arxiv.org/abs/1910.11666, https://lmcs.episciences.org/9038

zbMATH Keywords

closuredecidabilitylattice theoryexact learningresidual automatanominal automataderivative language

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Learning nominal automata
• Learning residual alternating automata
• scientific article; zbMATH DE number 1670711
• Learning Transparent Data Automata
• Inferring regular languages and \(\omega\)-languages

Cites work

• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 1886068 (Why is no real title available?)
• scientific article; zbMATH DE number 795584 (Why is no real title available?)
• A robust class of data languages and an application to learning
• Automata Learning
• Automata theory in nominal sets
• Coalgebraic constructions of canonical nondeterministic automata
• Combining black-box and white-box techniques for learning register automata
• Finite state machines for strings over infinite alphabets
• Finite-memory automata
• Finite-memory automata with non-deterministic reassignment
• Freshness and Name-Restriction in Sets of Traces with Names
• LOIS: syntax and semantics
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Learning Theory
• Learning nominal automata
• Learning regular sets from queries and counterexamples
• Learning weighted automata
• Linear Automaton Transformations
• Nominal Kleene coalgebra
• Nominal automata with name binding
• Nominal sets. Names and symmetry in computer science
• On computability and tractability for infinite sets
• On nominal regular languages with binders
• On rational stochastic languages
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• Runtime verification based on register automata
• SMT solving for functional programming over infinite structures
• Stone Duality for Nominal Boolean Algebras with И
• The containment problem for unambiguous register automata and unambiguous timed automata
• Towards nominal computation
• Unambiguity in automata theory

Cited in

(1)

• Learning probabilistic automata using residuals

Describes a project that uses

Uses Software

• LOIS
• NLambda

This page was built for publication: Residuality and learning for nondeterministic nominal automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028487)