Article

Bell, PC and Semukhin, P (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 and Potapov, I (2022) Towards Uniform Online Spherical Tessellations. Discrete and Computational Geometry: an international journal of mathematics and computer science. ISSN 0179-5376

Bell, PC (2022) Polynomially Ambiguous Probabilistic Automata on Restricted Languages. Journal of Computer and System Sciences. ISSN 0022-0000

Bell, PC and Hirvensalo, M (2021) On injectivity of quantum finite automata. Journal of Computer and System Sciences, 122. pp. 19-33. ISSN 0022-0000

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, Reidenbach, D and Shallit, J (2019) Unique Decipherability in Formal Languages. Theoretical Computer Science, 804. pp. 149-160. ISSN 0304-3975

Bell, PC, Chen, S and Jackson, LM (2019) Freeness Properties of Weighted and Probabilistic Automata over Bounded Languages. Information and Computation. ISSN 0890-5401

Bell, PC, Chen, S and Jackson, L (2016) On the decidability and complexity of problems for restricted hierarchical hybrid systems. Theoretical Computer Science, 652. pp. 47-63. ISSN 0304-3975

Conference or Workshop Item

Bell, PC, Niskanen, R, 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).

Bell, PC and Potapov, I (2022) Towards Uniform Online Spherical Tessellations. In: Lecture Notes in Computer Science , 67. pp. 1124-1146. (Computability in Europe, 15 July 2019 - 19 July 2019, Durham, UK).

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 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.

Bell, PC Polynomially Ambiguous Probabilistic Automata on Restricted Languages. In: LIPIcs : Leibniz International Proceedings in Informatics , 132. (International Colloquium on Automata, Languages and Programming (ICALP), 08 July 2019 - 12 July 2019, Patras, Greece). (Accepted)