activity
20162026
most citedReducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report)

3 citations · 11 across the 17 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.FL2017★ 1 cited

Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection (Technical Report)

Milan Ceska, Vojtech Havlena, Lukas Holik +2

We consider the problem of approximate reduction of non-deterministic automata that appear in hardware-accelerated network intrusion detection systems (NIDSes). We define an error…