Items where Author is "Semukhin, P"
Diekert, V, Potapov, I and Semukhin, P ORCID: 0000-0002-7547-6391
(2024)
Decidability of membership problems for flat rational subsets of GL(2,Q) and singular matrices.
SIAM Journal on Computing, 53 (6).
pp. 1663-1708.
ISSN 0097-5397
Bell, PC and Semukhin, P ORCID: 0000-0002-7547-6391
(2023)
Decision questions for probabilistic automata on small alphabets.
Logical Methods in Computer Science, 19 (4).
36:1-36:22.
ISSN 1860-5974
Bell, PC, Niskanen, R ORCID: 0000-0002-2210-1481, Potapov, I and Semukhin, P
(2023)
On the Identity and Group Problems for Complex Heisenberg Matrices.
In:
Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings
, 14235.
pp. 42-45.
(Reachability Problems: 17th International Conference, RP 2023, 11th October - 13th October 2023, Nice, France).
Semukhin, P, Kiefer, S and Widdershoven, C (2021) Linear-Time Model Checking Branching Processes. In: LIPIcs : Leibniz International Proceedings in Informatics , 203 (6). 6:1-6:16. (32nd International Conference on Concurrency Theory (CONCUR 2021), 24 August 2021 - 27 August 2021, Virtual Event).
Bell, PC and Semukhin, P (2021) Decision Questions for Probabilistic Automata on Small Alphabets. In: Leibniz International Proceedings in Informatics, LIPIcs , 202. (46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), 23-27 August 2021, Tallinn, Estonia).
Bell, PC, Potapov, I and Semukhin, P (2021) On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. Information and Computation. ISSN 0890-5401
Bell, PC and Semukhin, P (2020) Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata. In: The 31st International Conference on Concurrency Theory (CONCUR 2020), 31 August 2020 - 05 September 2020, Vienna, Austria.
Diekert, V, Potapov, I and Semukhin, P (2020) Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. In: ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020 . pp. 122-129. (45th International Symposium on Symbolic and Algebraic Computation, 20 July 2020 - 23 July 2020, Kalamata Greece).
Semukhin, P, Colcombet, T, Ouaknine, J and Worrell, J (2019) On Reachability Problems for Low-Dimensional Matrix Semigroup. In: LIPIcs : Leibniz International Proceedings in Informatics , 132 (44). 44:1-44:15. (46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 08 July 2019 - 12 July 2019, Patras, Greece).