1 citations · 2 across the 6 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026
Learning Automata with Name Allocation
Florian Frank, Stefan Milius, Jurriaan Rot +1
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values…
cs.FL2025
Complete Test Suites for Automata in Monoidal Closed Categories
Bálint Kocsis, Jurriaan Rot
Conformance testing of automata is about checking the equivalence of a known specification and a black-box implementation. An important notion in conformance testing is that of a c…