Language theoretic properties of regular DAG languages

We study sets of directed acyclic graphs, called regular DAG languages, which are accepted by a recently introduced type of DAG automata motivated by current developments in natural language proces ...

[1]  Johannes Blum.  DAG Automata - Variants, Languages and Properties , 2015 .

[2]  Philipp Koehn,et al.  Abstract Meaning Representation for Sembanking , 2013, LAW@ACL.

[3]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[4]  Johannes Blum,et al.  Properties of Regular DAG Languages , 2016, LATA.

[5]  Andreas Jakoby,et al.  Logspace Versions of the Theorems of Bodlaender and Courcelle , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[6]  Michaël Rusinowitch,et al.  Closure properties and decision problems of dag automata , 2005, Inf. Process. Lett..

[7]  Kevin Knight,et al.  Applications of Weighted Automata in Natural Language Processing , 2009 .

[8]  Witold Charatonik,et al.  Automata on DAG representations of finite trees , 1999 .

[9]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[10]  Kevin Knight,et al.  Towards Probabilistic Acceptors and Transducers for Feature Structures , 2012, SSST@ACL.

[11]  Jérôme Leroux,et al.  Structurally Cyclic Petri Nets , 2015, Log. Methods Comput. Sci..

[12]  Giora Slutzki,et al.  Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs , 1981, Inf. Control..

[13]  Wolfgang Thomas,et al.  NONDETERMINISM VERSUS DETERMINISM OF FINITE AUTOMATA OVER DIRECTED ACYCLIC GRAPHS , 1994 .

[14]  Kevin Knight,et al.  Training Tree Transducers , 2004, NAACL.

[15]  Lutz Priese.  Finite Automata on Unranked and Unordered DAGs , 2007, Developments in Language Theory.

[16]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.