Active learning of deterministic transducers with outputs in arbitrary monoids

DOI10.4230/LIPICS.CSL.2024.11MaRDI QIDQ6856048zbMATH OpenFDO

Authors Quentin Aristote

Publication date 19 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2024.11

zbMATH Keywords

active learningcategory theorymonoidstransducers

Mathematics Subject Classification ID

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

Cites work

• A general class of monoids supporting canonisation and minimisation of (sub)sequential transducers
• Applications of weighted automata in natural language processing
• Automata Learning
• Coalgebra learning via duality
• scientific article; zbMATH DE number 3845811 (Why is no real title available?)
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)
• scientific article; zbMATH DE number 7199591 (Why is no real title available?)
• Learning automata and transducers: a categorical approach
• Learning automata with side-effects
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Learning regular sets from queries and counterexamples
• Minimizing subsequential transducers: a survey.
• On the definition of a family of automata

Cited in

(3)

• Active learning of deterministic transducers with outputs in arbitrary monoids
• Function spaces for orbit-finite sets
• Learning bottom-up tree automata valued in monoidal categories

This page was built for publication: Active learning of deterministic transducers with outputs in arbitrary monoids

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