Cover Image

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Aristote, Quentin
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Active Learning of Upward-Closed Sets of Words
by: Aristote, Quentin
Published: (2025)

Learning Weighted Automata over Number Rings, Concretely and Categorically
by: Aristote, Quentin, et al.
Published: (2025)

Reversible Pebble Transducers
by: Dartois, Luc, et al.
Published: (2025)

Approximate Problems for Finite Transducers
by: Filiot, Emmanuel, et al.
Published: (2025)

Extended Stone Duality via Monoidal Adjunctions
by: Lenke, Fabian, et al.
Published: (2024)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
by: Kuriyama, Takayuki
Published: (2014)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Attributed Tree Transducers for Partial Functions
by: Maneth, Sebastian, et al.
Published: (2024)

Reversible Transducers over Infinite Words
by: Dartois, Luc, et al.
Published: (2024)

Composing Copyless Streaming String Transducers
by: Alur, Rajeev, et al.
Published: (2022)

Minimizing Streaming String Transducers: An algebraic approach
by: Benalioua, Yahia Idriss, et al.
Published: (2026)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
by: Kostolányi, Peter, et al.
Published: (2026)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)

A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)

Learning Deterministic Multi-Clock Timed Automata
by: Teng, Yu, et al.
Published: (2024)

Efficient Learning of Weak Deterministic Büchi Automata
by: Alluwayma, Mona, et al.
Published: (2025)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
by: Gallot, Paul, et al.
Published: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
by: Casares, Antonio, et al.
Published: (2024)

Transducing Language Models
by: Snæbjarnarson, Vésteinn, et al.
Published: (2026)

Passive Model Learning of Visibly Deterministic Context-free Grammars
by: Muškardin, Edi, et al.
Published: (2025)

When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
by: Maneth, Sebastian, et al.
Published: (2025)

A Diamond Structure in the Transducer Hierarchy
by: Kaufmann, Noah
Published: (2021)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)

Hyper-Minimization for Deterministic Register Automata
by: Li, Yong, et al.
Published: (2026)

Transformers as Transducers
by: Strobl, Lena, et al.
Published: (2024)

Token Games and History-Deterministic Quantitative-Automata
by: Boker, Udi, et al.
Published: (2021)

Active Learning of Symbolic Mealy Automata
by: Irie, Kengo, et al.
Published: (2025)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)

A Linear-time Simulation of Deterministic $d$-Limited Automata
by: Rubtsov, Alexander
Published: (2023)

Constructing Deterministic Parity Automata from Positive and Negative Examples
by: Bohn, León, et al.
Published: (2023)

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Cayley Automatic Groups and Numerical Characteristics of Turing Transducers
by: Berdinsky, Dmitry
Published: (2016)

The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
by: Lehtinen, Karoliina, et al.
Published: (2025)

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
by: Wißmann, Thorsten
Published: (2026)

Monads, Comonads, and Transducers
by: Stefański, Rafał
Published: (2024)

Minimization of Streaming Transducers
by: Bianchini, Christian, et al.
Published: (2026)

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
by: Kuriyama, Takayuki
Published: (2026)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)