We have aimed to develop a formalism for DAG automata that lends itself to efficient algorithms for processing semantic graphs such as Abstract Meaning Representations.
motivated by the success of finite-state methods in natural language processing, we have tried to develop a graph analog of standard finite-state automata for strings.