Cover Image

Behaviorally Correct Learning from Informants

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Mohrin, Niklas
Format:	Preprint
Published:	2025
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

Correctness Notions for Petri Nets with Identifiers
by: van der Werf, Jan Martijn E. M., et al.
Published: (2022)

Corrections to A Menagerie of Timed Automata
by: Keiren, Jeroen J. A., et al.
Published: (2016)

Characterizations of Controlled Generation of Right Linear Grammars with Unknown Behaviors
by: Ise, Daihei, et al.
Published: (2024)

Passive Learning of Lattice Automata from Recurrent Neural Networks
by: Slimi, Jaouhar, et al.
Published: (2025)

Learning Event-recording Automata Passively
by: Majumdar, Anirban, et al.
Published: (2025)

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

Learning EFSM Models with Registers in Guards
by: Vega, Germán, et al.
Published: (2024)

Query Learning of Advice and Nominal Automata
by: Zhou, Kevin
Published: (2024)

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

Scalable Tree-based Register Automata Learning
by: Dierl, Simon, et al.
Published: (2024)

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

Componentwise Automata Learning for System Integration (Extended Version)
by: Fujinami, Hiroya, et al.
Published: (2025)

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
by: Aristote, Quentin
Published: (2024)

Greybox Learning of Languages Recognizable by Event-Recording Automata
by: Majumdar, Anirban, et al.
Published: (2024)

Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
by: Stan, Daniel, et al.
Published: (2026)

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

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

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

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
by: Shoudai, Takayoshi, et al.
Published: (2026)

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

RESTL: Reinforcement Learning Guided by Multi-Aspect Rewards for Signal Temporal Logic Transformation
by: Fang, Yue, et al.
Published: (2025)

Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior
by: Paul, Subrata, et al.
Published: (2024)

Synthesising Asynchronous Automata from Fair Specifications
by: Bérard, Béatrice, et al.
Published: (2025)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)

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

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
by: Pert, Charles, et al.
Published: (2024)

Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions
by: Bergenthum, Robin, et al.
Published: (2026)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

Statistical process discovery
by: Cry, Pierre, et al.
Published: (2025)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
by: Jeppson, Joshua, et al.
Published: (2025)

Hyper pattern matching
by: Waga, Masaki, et al.
Published: (2025)

Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)

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

Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)

Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
by: Kim, Moon, et al.
Published: (2025)

Castor Ministerialis
by: Hercher, Christian
Published: (2025)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)

Unambiguisability and Register Minimisation of Min-Plus Models
by: Almagor, Shaull, et al.
Published: (2025)

An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
by: Finkel, Alain, et al.
Published: (2025)