Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Kirsten, Daniel
2012.
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring.
Theoretical Computer Science,
Vol. 420,
Issue. ,
p.
56.
Lahaye, Sébastien
Komenda, Jan
and
Boimond, Jean-Louis
2015.
Supervisory control of (max,+) automata: extensions towards applications.
International Journal of Control,
Vol. 88,
Issue. 12,
p.
2523.
Lahaye, Sébastien
Komenda, Jan
and
Boimond, Jean-Louis
2015.
Compositions of (max, +) automata.
Discrete Event Dynamic Systems,
Vol. 25,
Issue. 1-2,
p.
323.
Paul, Erik
2016.
Developments in Language Theory.
Vol. 9840,
Issue. ,
p.
368.
Komenda, Jan
Lahaye, Sébastien
and
Boimond, Jean-Louis
2016.
Determinization of timed Petri nets behaviors.
Discrete Event Dynamic Systems,
Vol. 26,
Issue. 3,
p.
413.
Mohri, Mehryar
and
Riley, Michael D.
2017.
A disambiguation algorithm for weighted automata.
Theoretical Computer Science,
Vol. 679,
Issue. ,
p.
53.
Triska, Lukas
and
Moor, Thomas
2020.
Behaviour Equivalent Max-Plus Automata for a Class of Timed Petri Nets.
IFAC-PapersOnLine,
Vol. 53,
Issue. 4,
p.
75.
Daviaud, Laure
2020.
Register complexity and determinisation of max-plus automata.
ACM SIGLOG News,
Vol. 7,
Issue. 2,
p.
4.
Lai, Aiwen
Lahaye, Sébastien
and
Li, Zhiwu
2021.
Initial-state detectability and initial-state opacity of unambiguous weighted automata.
Automatica,
Vol. 127,
Issue. ,
p.
109490.
Paul, Erik
2021.
Finite Sequentiality of Unambiguous Max-Plus Tree Automata.
Theory of Computing Systems,
Vol. 65,
Issue. 4,
p.
736.
Triska, Lukas
and
Moor, Thomas
2021.
Behaviour equivalent max-plus automata for timed petri nets under open-loop race-policy semantics.
Discrete Event Dynamic Systems,
Vol. 31,
Issue. 4,
p.
583.
Kostolányi, Peter
2022.
Computer Science – Theory and Applications.
Vol. 13296,
Issue. ,
p.
209.
Almagor, Shaull
Boker, Udi
and
Kupferman, Orna
2022.
What's decidable about weighted automata?.
Information and Computation,
Vol. 282,
Issue. ,
p.
104651.
Lai, Aiwen
Lahaye, Sebastien
and
Komenda, Jan
2022.
Observer Construction for Polynomially Ambiguous Max-Plus Automata.
IEEE Transactions on Automatic Control,
Vol. 67,
Issue. 3,
p.
1582.
Kostolányi, Peter
2023.
Polynomially Ambiguous Unary Weighted Automata over Fields.
Theory of Computing Systems,
Vol. 67,
Issue. 2,
p.
291.
Almagor, Shaull
and
Dafni, Neta
2024.
Foundations of Software Science and Computation Structures.
Vol. 14574,
Issue. ,
p.
191.
Paul, Erik
2024.
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata.
Theory of Computing Systems,
Vol. 68,
Issue. 4,
p.
615.
Daviaud, Bérangère
Lahaye, Sébastien
Lhommeau, Mehdi
and
Komenda, Jan
2024.
On the Existence of Simulations for Max-Plus Automata.
IEEE Control Systems Letters,
Vol. 8,
Issue. ,
p.
694.
Kostolányi, Peter
2024.
Finitely ambiguous and finitely sequential weighted automata over fields.
Theoretical Computer Science,
Vol. 1012,
Issue. ,
p.
114725.