9 citations · 15 across the 6 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2024
PDFA Distillation via String Probability Queries
Robert Baumgartner, Sicco Verwer
Probabilistic deterministic finite automata (PDFA) are discrete event systems modeling conditional probabilities over languages: Given an already seen sequence of tokens they retur…
cs.FL2024
Database-assisted automata learning
Hielke Walinga, Robert Baumgartner, Sicco Verwer
This paper presents DAALder (Database-Assisted Automata Learning, with Dutch suffix from leerder), a new algorithm for learning state machines, or automata, specifically determinis…
cs.FL2022
Learning state machines via efficient hashing of future traces
Robert Baumgartner, Sicco Verwer
State machines are popular models to model and visualize discrete systems such as software systems, and to represent regular grammars. Most algorithms that passively learn state ma…