Skip to main content
Conference Proceedings

Properties of regular DAG languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9618 427-438
DOI: 10.1007/978-3-319-30000-9_33
6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Blum, J., & Drewes, F. (2016). Properties of regular DAG languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9618, pp. 427–438). Springer Verlag. https://doi.org/10.1007/978-3-319-30000-9_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free