Extends the notion of Deterministic Finite state Automata to Directed Acyclic Graphs. Uses the Minimum Description Length principle to learn these DAG Automata from examples.
More details availible in the companion paper: https://www.usenix.org/system/files/conference/tapp2017/tapp17_paper_lemay.pdf