umu.sePublications
Change search
ReferencesLink to record
Permanent link

Direct link
Properties of Regular DAG Languages
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)ORCID iD: 0000-0001-7349-7693
2016 (English)In: Proc. 10th International Conference on Language and Automata Theory and Applications (LATA 2016) / [ed] A.H. Dediu, J. Janoušek, C. Martín-Vide, and B. Truthe, Springer Publishing Company, 2016, 427-438 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer Publishing Company, 2016. 427-438 p.
Series
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 9618
National Category
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-111983DOI: 10.1007/978-3-319-30000-9_33ISI: 000378745100038ISBN: 978-3-319-30000-9ISBN: 978-3-319-29999-0OAI: oai:DiVA.org:umu-111983DiVA: diva2:874859
Conference
10th International Conference on Language and Automata Theory and Applications (LATA 2016), Prague, Czech Republic, March 14-18, 2016
Available from: 2015-11-29 Created: 2015-11-29 Last updated: 2016-08-02Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Blum, JohannesDrewes, Frank
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 183 hits
ReferencesLink to record
Permanent link

Direct link