Cover Image

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Laumen, Jasper, Snel, Leonne, Vaandrager, Frits
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory 68Q45
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)

Active Learning of Mealy Machines with Timers
by: Bruyère, Véronique, et al.
Published: (2024)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

Learning Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2025)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
by: Martynova, Olga, et al.
Published: (2025)

Bounded Languages Described by GF(2)-grammars
by: Makarov, Vladislav
Published: (2019)

Linear equations and recursively enumerable sets
by: Honkala, Juha
Published: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
Published: (2024)

Around Don's conjecture for binary completely reachable automata
by: Zhu, Yinfeng
Published: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)

Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)

Illustrating Finite Automata with Grail+ and TikZ
by: May, Alastair, et al.
Published: (2024)

Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)

Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)

Alternating Nominal Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2024)

Nominal Tree Automata With Name Allocation
by: Prucker, Simon, et al.
Published: (2024)

New Fault Domains for Conformance Testing of Finite State Machines
by: Vaandrager, Frits, et al.
Published: (2024)

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
by: Volkov, Mikhail V.
Published: (2025)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, et al.
Published: (2025)

On the Intersection Problem for Quantum Finite Automata
by: Benso, Andrea, et al.
Published: (2024)

Addition Automata and Attractors of Digit Systems Corresponding to Expanding Rational Matrices
by: Cruz, Anjelo Gabriel R., et al.
Published: (2025)

On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)

A polynomial-time algorithm for the automatic Baire property
by: Staiger, Ludwig
Published: (2025)

A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

Weakly-unambiguous Parikh automata and their link to holonomic series
by: Bostan, Alin, et al.
Published: (2025)

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
by: German, Samuel
Published: (2026)

Systematic Evaluation of Black-Box Checking for Fast Bug Detection
by: Pellen, Bram, et al.
Published: (2025)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
Published: (2025)

Eve-positional languages: putting order into Büchi automata
by: Idir, Olivier
Published: (2026)

An algebraic characterisation of Eve-positional languages
by: Colcombet, Thomas, et al.
Published: (2026)

On universality of regular realizability problems
by: Rubtsov, Alexander, et al.
Published: (2023)