Group by: Item Type | No Grouping
Number of items: 15.

Article

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X (2022) Polynomially ambiguous probabilistic automata on restricted languages. Journal of Computer and System Sciences, 127. 53 - 65.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X and Potapov, I (2022) Towards Uniform Online Spherical Tessellations. Discrete & Computational Geometry, 67 (4). 1124 - 1146.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X and Hirvensalo, M (2021) On Injectivity of Quantum Finite Automata. Journal of Computer and System Sciences, 122. pp. 19-33.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X, Potapov, I and Semukhin, P (2021) On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. Information and Computation, 281 (104736).

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X, Reidenbach, D and Shallit, JO (2020) Unique decipherability in formal languages. Theoretical Computer Science, 804. 149 - 160.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X, Chen, S and Jackson, L (2019) Freeness properties of weighted and probabilistic automata over bounded languages. Information and Computation, 269 (104440). -.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X, Chen, S and Jackson, L (2016) On the decidability and complexity of problems for restricted hierarchical hybrid systems. Theoretical Computer Science, 652. 47 - 63.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X and Wong, PWH (2015) Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines. Journal of Combinatorial Optimization, 29 (4). 739 - 749.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X and Potapov, I (2010) ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS. International Journal of Foundations of Computer Science, 21 (6). 963 - 978.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X, Delvenne, J-C, Jungers, RM and Blondel, VD (2010) The continuous Skolem-Pisot problem. Theoretical Computer Science, 411 (40-42). 3625 - 3634.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X and Potapov, I (2008) Reachability problems in quaternion matrix and rotation semigroups. Information and Computation, 206 (11). 1353 - 1361.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X, Halava, V, Harju, T, Karhumaki, J and Potapov, I (2008) MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM. International Journal of Algebra and Computation, 18 (8). 1231 - 1241.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X and Potapov, I (2008) On undecidability bounds for matrix decision problems. Theoretical Computer Science, 391 (1-2). 3 - 13.

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X and Potapov, I (2007) On the membership of invertible diagonal and scalar matrices. Theoretical Computer Science, 372 (1). 37 - 45.

Conference or Workshop Item

Bell, PC ORCID: https://orcid.org/0000-0003-2620-635X, Hirvensalo, M, Potapov, I and ACM, . (2017) The Identity Problem for Matrix Semigroups in SL2(Z) is NP-complete. In: ACM-SIAM Symposium on Discrete Algorithms.

This list was generated on Wed Nov 1 00:04:48 2023 UTC.