Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Théodore Lopez, Benjamin Monmege, and Jean-Marc Talbot. Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 75:1-75:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{lopez_et_al:LIPIcs.MFCS.2019.75, author = {Lopez, Th\'{e}odore and Monmege, Benjamin and Talbot, Jean-Marc}, title = {{Determinisation of Finitely-Ambiguous Copyless Cost Register Automata}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {75:1--75:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.75}, URN = {urn:nbn:de:0030-drops-110190}, doi = {10.4230/LIPIcs.MFCS.2019.75}, annote = {Keywords: Cost-register automata, Look-ahead removal, Unambiguity, Determinisation} }
Feedback for Dagstuhl Publishing