Publikation: Properties of Regular DAG Languages
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2016
Autor:innen
Drewes, Frank
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
DEDIU, Adrian-Horia, ed., Jan JANOUŠEK, ed., Carlos MARTÍN-VIDE, ed., Bianca TRUTHE, ed.. Language and Automata Theory and Applications : 10th International Conference, LATA 2016, Proceedings. Cham: Springer, 2016, pp. 427-438. Lecture Notes in Computer Science. 9618. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-29999-0. Available under: doi: 10.1007/978-3-319-30000-9_33
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Language and Automata Theory and Applications : 10th International Conference, LATA 2016, 14. März 2016 - 18. März 2016, Prague, Czech Republic
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
BLUM, Johannes, Frank DREWES, 2016. Properties of Regular DAG Languages. Language and Automata Theory and Applications : 10th International Conference, LATA 2016. Prague, Czech Republic, 14. März 2016 - 18. März 2016. In: DEDIU, Adrian-Horia, ed., Jan JANOUŠEK, ed., Carlos MARTÍN-VIDE, ed., Bianca TRUTHE, ed.. Language and Automata Theory and Applications : 10th International Conference, LATA 2016, Proceedings. Cham: Springer, 2016, pp. 427-438. Lecture Notes in Computer Science. 9618. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-29999-0. Available under: doi: 10.1007/978-3-319-30000-9_33BibTex
@inproceedings{Blum2016-02-26Prope-44806, year={2016}, doi={10.1007/978-3-319-30000-9_33}, title={Properties of Regular DAG Languages}, number={9618}, isbn={978-3-319-29999-0}, issn={0302-9743}, publisher={Springer}, address={Cham}, series={Lecture Notes in Computer Science}, booktitle={Language and Automata Theory and Applications : 10th International Conference, LATA 2016, Proceedings}, pages={427--438}, editor={Dediu, Adrian-Horia and Janoušek, Jan and Martín-Vide, Carlos and Truthe, Bianca}, author={Blum, Johannes and Drewes, Frank} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/44806"> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:contributor>Blum, Johannes</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-01T13:25:43Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-01T13:25:43Z</dc:date> <dcterms:issued>2016-02-26</dcterms:issued> <dc:contributor>Drewes, Frank</dc:contributor> <dc:creator>Drewes, Frank</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44806"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:language>eng</dc:language> <dc:creator>Blum, Johannes</dc:creator> <dcterms:title>Properties of Regular DAG Languages</dcterms:title> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <foaf:homepage rdf:resource="http://localhost:8080/"/> </rdf:Description> </rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein