pith. sign in
Pith Number

pith:QMR3XZRX

pith:2026:QMR3XZRXDUCFWMFPQ6TKKW2PPB
not attested not anchored not stored refs resolved

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

Frits Vaandrager, Jasper Laumen, Leonne Snel

A simple algorithm based on L# learns minimal DFAs that separate two disjoint languages.

arxiv:2605.15294 v1 · 2026-05-14 · cs.FL

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{QMR3XZRXDUCFWMFPQ6TKKW2PPB}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We propose a simple active learning algorithm, inspired by L#, that learns a minimal separating DFA for disjoint languages L1 and L2 if one exists.

C2weakest assumption

The two input languages are disjoint and a finite minimal separating DFA for them exists (abstract, first paragraph).

C3one line summary

An L#-inspired active learning algorithm learns minimal separating DFAs for disjoint languages when one exists and outperforms prior methods on random and industrial benchmarks.

References

36 extracted · 36 resolved · 0 Pith anchors

[1] Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987).https://doi.org/10.1016/0890-5401(87)90052-6 1987 · doi:10.1016/0890-5401(87)90052-6
[2] Balle, B., Carreras, X., Luque, F.M., Quattoni, A.: Spectral learning of weighted automata - A forward-backward perspective. Mach. Learn.96(1-2), 33–63 (2014). https://doi.org/10.1007/S10994-013-5416- 2014 · doi:10.1007/s10994-013-5416-x
[3] Bar-Sinai, M., Elyasaf, A., Weiss, G., Weiss, Y.: Provengo: A tool suite for scenario driven model-based testing. In: ASE. pp. 2062–2065. IEEE (2023).https://doi. org/10.48550/ARXIV.2308.15938 2062 · doi:10.48550/arxiv.2308.15938
[4] IEEE Transactions on ComputersC-21(6), 592–597 (1972).https://doi.org/10.1109/TC.1972.5009015 1972 · doi:10.1109/tc.1972.5009015
[5] In: Prabhakar, P., Vandin, A 2025 · doi:10.1007/978-3-032-05792-1_3
Receipt and verification
First computed 2026-05-20T00:00:51.136782Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

8323bbe6371d045b30af87a6a55b4f7845a0b5340d60414bb78cbf99e7a4b36e

Aliases

arxiv: 2605.15294 · arxiv_version: 2605.15294v1 · doi: 10.48550/arxiv.2605.15294 · pith_short_12: QMR3XZRXDUCF · pith_short_16: QMR3XZRXDUCFWMFP · pith_short_8: QMR3XZRX
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/QMR3XZRXDUCFWMFPQ6TKKW2PPB \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 8323bbe6371d045b30af87a6a55b4f7845a0b5340d60414bb78cbf99e7a4b36e
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "3a2f8a217ab24c949beb3a597e8180f43719f1f75c26462d74ca2a67ec31982a",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.FL",
    "submitted_at": "2026-05-14T18:10:19Z",
    "title_canon_sha256": "93cf868a6be0cd0139d78001bdaed7e4160d109bdcc85eda2ddaf11d82a56353"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15294",
    "kind": "arxiv",
    "version": 1
  }
}