Properties of Regular DAG Languages

  • Johannes Blum
  • Frank Drewes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9618)


A DAG is a directed acyclic graph. We study the properties of DAG automata and their languages, called regular DAG languages. In particular, we prove results resembling pumping lemmas and show that the finiteness problem for regular DAG languages is in P.



We thank the referees for their careful work, and especially for pointing out a mistake in the original version of the proof of Lemma 8. The second author is grateful to David Chiang, Daniel Gildea, Adam Lopez, and Giorgio Satta for many inspiring discussions regarding DAG automata.


  1. 1.
    Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5), 231–240 (2005)CrossRefMathSciNetzbMATHGoogle Scholar
  2. 2.
    Banarescu, L., Bonial, C., Cai, S., Georgescu, M., Griffitt, K., Hermjakob, U., Knight, K., Koehn, P., Palmer, M., Schneider, N.: Abstract meaning representation for sembanking. In: Proceedings of 7th Linguistic Annotation Workshop, ACL 2013 Workshop (2013)Google Scholar
  3. 3.
    Blum, J.: DAG Automata - Variants, Languages and Properties. Master thesis, Umeå University (2015)Google Scholar
  4. 4.
    Charatonik, W.: Automata on dag representations of finite trees. Research Report MPI-I-1999-2-001, Max-Planck-Institut für Informatik, Saarbrücken (1999)Google Scholar
  5. 5.
    Chiang, D., Drewes, F., Gildea, D., Lopez, A., Satta, G.: Weighted and extended DAG automata for semantic graphs (2015) (in preparation)Google Scholar
  6. 6.
    Drewes, F., Leroux, J.: Structurally cyclic petri nets. Logical Methods in Computer Science (2015) (to appear)Google Scholar
  7. 7.
    Kamimura, T., Slutzki, G.: Parallel and two-way automata on directed ordered acyclic graphs. Inf. Control 49, 10–51 (1981)CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    Potthoff, A., Seibert, S., Thomas, W.: Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bull. Belgian Math. Soc. Simon Stevin 1(2), 285 (1994)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Priese, L.: Finite automata on unranked and unordered DAGs. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 346–360. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Quernheim, D., Knight, K.: Towards probabilistic acceptors and transducers for feature structures. In: Proceedings of 6th Workshop on Syntax, Semantics and Structure in Statistical Translation, pp. 76–85. Association for Computational Linguistics (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Computing ScienceUmeå UniversityUmeåSweden

Personalised recommendations