The boundedness and zero isolation problems for weighted automata over nonnegative rationals-Reference-Cited by-同舟云学术

The boundedness and zero isolation problems for weighted automata over nonnegative rationals

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Czerwiński Wojciech¹,Lefaucheux Engel²,Mazowiecki Filip³,Purser David³,Whiteland Markus⁴

Affiliation:

1. University of Warsaw, Poland

2. Université de Lorraine, Inria, LORIA, Nancy, France

3. Max Planck Institute for Software Systems, Saarland Informatics Campus, Germany

4. Max Planck Institute for Software Systems, Saarland Informatics Campus, Belgium and University of Liège, Belgium

Funder

European Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3531130.3533336

Reference39 articles.

1. Weak Cost Register Automata are Still Powerful

2. Rajeev Alur , Loris D’Antoni , Jyotirmoy V. Deshmukh , Mukund Raghothaman , and Yifei Yuan . 2013 . Regular Functions and Cost Register Automata. In 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013 , New Orleans, LA, USA , June 25-28, 2013. 13–22. https://doi.org/10.1109/LICS.2013.65 Rajeev Alur, Loris D’Antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman, and Yifei Yuan. 2013. Regular Functions and Cost Register Automata. In 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013. 13–22. https://doi.org/10.1109/LICS.2013.65

3. Corentin Barloy , Nathanaël Fijalkow , Nathan Lhote , and Filip Mazowiecki . 2020 . A Robust Class of Linear Recurrence Sequences . In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020 , January 13-16, 2020, Barcelona, Spain(LIPIcs, Vol. 152), Maribel Fernández and Anca Muscholl (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1–9:16. https://doi.org/10.4230/LIPIcs.CSL. 2020.9 Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, and Filip Mazowiecki. 2020. A Robust Class of Linear Recurrence Sequences. In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain(LIPIcs, Vol. 152), Maribel Fernández and Anca Muscholl (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1–9:16. https://doi.org/10.4230/LIPIcs.CSL.2020.9

4. Learning functions represented as multiplicity automata

5. Jean Berstel and Christophe Reutenauer . 1988. Rational series and their languages. EATCS monographs on theoretical computer science , Vol. 12 . Springer . https://www.worldcat.org/oclc/17841475 Jean Berstel and Christophe Reutenauer. 1988. Rational series and their languages. EATCS monographs on theoretical computer science, Vol. 12. Springer. https://www.worldcat.org/oclc/17841475

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete);2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26