Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Frits Vaandrager
Computer Science > Formal Languages and Automata Theory
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Bezuinigen op ‘woke’ of diversiteitscommissies aan de universiteit levert nauwelijks iets op
Opinie De historische bezuinigingen van 1 miljard (meer dan 10 procent) op het hoger onderwijs in het regeringsprogramma kunnen voor een belangrijk deel worden opgevangen door te bezuinigen op ‘woke’, aldus hoogleraar Frank Hartmann (ND 21 september). Maar zijn voorbeelden overtuigen zijn collega Frits Vaandrager niet en wekken volgens hem de kwalijke suggestie dat de PVV-ideeën hierover zouden kloppen.
[2403.02019] Active Learning of Mealy Machines with Timers
arXiv:2403.02019 (cs) [Submitted on 4 Mar 2024 (v1), last revised 19 Aug 2025 (this version, v3)] View PDF Comments: Subjects: Formal Languages and Automata Theory (cs.FL); Machine Learning (cs.LG) MSC classes: 68Q45 ACM classes: F.4.3 Cite as: arXiv:2403.02019 [cs.FL] (or arXiv:2403.02019v3 [cs.FL] for this version) https://doi.org/10.48550/arXiv.2403.02019 Submission history From: Gaëtan Staquet [ view email] [v1] Mon, 4 Mar 2024 13:20:52 UTC (366 KB) [v2] Wed, 30 Oct 2024 13:49:15 UTC (163...
[2305.07451] Automata with Timers
In this work, we study properties of deterministic finite-state automata with timers, a subclass of timed automata proposed by Vaandrager et al. as a candidate for an efficiently learnable timed model. We first study the complexity of the configuration reachability problem for such automata and establish that it is PSPACE-complete.
Communications of the ACM
We routinely manage to learn the behavior of a device or computer program by just pressing buttons and observing the resulting behavior. Especially children are very good at this and know exactly how to use a smartphone or microwave oven without ever consulting a manual. In such situations, we construct a mental model or state diagram of the device: through experiments we determine in which global states the device can be and which state transitions and outputs occur in response to which inputs.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Frits
Contact Frits, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack