A regular language implementation of Siskind's event logic. Described here: http://sjf.io/Regular_Languages_For_Siskinds_Event_Logic.pdf
It was submitted as my final year project for Computer Science in Trinity College Dublin.
It is designed to be a proof that the temporal logic used in event recognition can be implemented as regular language/finite automata.
Includes a regular expression engine and a complete set of functions for constructing and combining finite automata.