@inproceedings{daviaud_et_al:LIPIcs.MFCS.2023.40,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: cost register automata, universality, forall-exact problem, decidability},
    Author = {Daviaud, Laure and Ryzhikov, Andrew},
    BookTitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
    Editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
    File = {Universality and Forall-Exactness of Cost Register Automata with Few Registers - LIPIcs-MFCS-2023-40.pdf},
    ISBN = {978-3-95977-292-1},
    ISSN = {1868-8969},
    Pages = {40:1--40:15},
    Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{Universality and Forall-Exactness of Cost Register Automata with Few Registers}},
    URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18574},
    Volume = {272},
    Year = {2023},
    bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2023/18574},
    bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.MFCS.2023.40},
    date-added = {2023-08-26 08:15:55 +0200},
    date-modified = {2023-08-26 08:15:55 +0200},
    urn = {urn:nbn:de:0030-drops-185744},
    doi = {10.4230/LIPIcs.MFCS.2023.40}
}

@inproceedings{daviaud_et_al:LIPIcs.MFCS.2023.40, Address = {Dagstuhl, Germany}, Annote = {Keywords: cost register automata, universality, forall-exact problem, decidability}, Author = {Daviaud, Laure and Ryzhikov, Andrew}, BookTitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, Editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, File = {Universality and Forall-Exactness of Cost Register Automata with Few Registers - LIPIcs-MFCS-2023-40.pdf}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, Pages = {40:1--40:15}, Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{Universality and Forall-Exactness of Cost Register Automata with Few Registers}}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18574}, Volume = {272}, Year = {2023}, bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2023/18574}, bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.MFCS.2023.40}, date-added = {2023-08-26 08:15:55 +0200}, date-modified = {2023-08-26 08:15:55 +0200}, urn = {urn:nbn:de:0030-drops-185744}, doi = {10.4230/LIPIcs.MFCS.2023.40} }