A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
RAIRO-Theor. Inf. Appl., 42 3 (2008) 553-581
Published online: 2008-06-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
Erik PaulTheory of Computing Systems 68 (4) 615 (2024)
https://doi.org/10.1007/s00224-021-10049-6
Finitely ambiguous and finitely sequential weighted automata over fields
Peter KostolányiTheoretical Computer Science 1012 114725 (2024)
https://doi.org/10.1016/j.tcs.2024.114725
On the Existence of Simulations for Max-Plus Automata
Bérangère Daviaud, Sébastien Lahaye, Mehdi Lhommeau and Jan KomendaIEEE Control Systems Letters 8 694 (2024)
https://doi.org/10.1109/LCSYS.2024.3401415
14574 191 (2024)
https://doi.org/10.1007/978-3-031-57228-9_10
Polynomially Ambiguous Unary Weighted Automata over Fields
Peter KostolányiTheory of Computing Systems 67 (2) 291 (2023)
https://doi.org/10.1007/s00224-022-10107-7
Observer Construction for Polynomially Ambiguous Max-Plus Automata
Aiwen Lai, Sebastien Lahaye and Jan KomendaIEEE Transactions on Automatic Control 67 (3) 1582 (2022)
https://doi.org/10.1109/TAC.2021.3069899
What's decidable about weighted automata?
Shaull Almagor, Udi Boker and Orna KupfermanInformation and Computation 282 104651 (2022)
https://doi.org/10.1016/j.ic.2020.104651
Computer Science – Theory and Applications
Peter KostolányiLecture Notes in Computer Science, Computer Science – Theory and Applications 13296 209 (2022)
https://doi.org/10.1007/978-3-031-09574-0_13
Finite Sequentiality of Unambiguous Max-Plus Tree Automata
Erik PaulTheory of Computing Systems 65 (4) 736 (2021)
https://doi.org/10.1007/s00224-020-10021-w
Behaviour equivalent max-plus automata for timed petri nets under open-loop race-policy semantics
Lukas Triska and Thomas MoorDiscrete Event Dynamic Systems 31 (4) 583 (2021)
https://doi.org/10.1007/s10626-021-00346-0
Initial-state detectability and initial-state opacity of unambiguous weighted automata
Aiwen Lai, Sébastien Lahaye and Zhiwu LiAutomatica 127 109490 (2021)
https://doi.org/10.1016/j.automatica.2021.109490
Behaviour Equivalent Max-Plus Automata for a Class of Timed Petri Nets
Lukas Triska and Thomas MoorIFAC-PapersOnLine 53 (4) 75 (2020)
https://doi.org/10.1016/j.ifacol.2021.04.049
Register complexity and determinisation of max-plus automata
Laure DaviaudACM SIGLOG News 7 (2) 4 (2020)
https://doi.org/10.1145/3397619.3397621
A disambiguation algorithm for weighted automata
Mehryar Mohri and Michael D. RileyTheoretical Computer Science 679 53 (2017)
https://doi.org/10.1016/j.tcs.2016.08.019
Determinization of timed Petri nets behaviors
Jan Komenda, Sébastien Lahaye and Jean-Louis BoimondDiscrete Event Dynamic Systems 26 (3) 413 (2016)
https://doi.org/10.1007/s10626-015-0214-1
Developments in Language Theory
Erik PaulLecture Notes in Computer Science, Developments in Language Theory 9840 368 (2016)
https://doi.org/10.1007/978-3-662-53132-7_30
Compositions of (max, +) automata
Sébastien Lahaye, Jan Komenda and Jean-Louis BoimondDiscrete Event Dynamic Systems 25 (1-2) 323 (2015)
https://doi.org/10.1007/s10626-014-0186-6
Supervisory control of (max,+) automata: extensions towards applications
Sébastien Lahaye, Jan Komenda and Jean-Louis BoimondInternational Journal of Control 88 (12) 2523 (2015)
https://doi.org/10.1080/00207179.2015.1048295
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
Daniel KirstenTheoretical Computer Science 420 56 (2012)
https://doi.org/10.1016/j.tcs.2011.11.006