On the Membership of Invertible Diagonal Matrices. - Paul Bell; Igor Potapov (Developments in Language Theory, 2005)

Lowering Undecidability Bounds for Decision Questions in Matrices. - Paul Bell; Igor Potapov (Developments in Language Theory, 2006)

A Note on the Emptiness of Semigroup Intersections. - Paul Bell (Fundam. Informaticae, 2007)

On the membership of invertible diagonal and scalar matrices. - Paul Bell; Igor Potapov (Theor. Comput. Sci., 2007)

Computational problems in matrix semigroups. - Paul C. Bell (2007)

Periodic and Infinite Traces in Matrix Semigroups. - Paul Bell; Igor Potapov (SOFSEM, 2008)

Reachability problems in quaternion matrix and rotation semigroups. - Paul Bell; Igor Potapov (Inf. Comput., 2008)

Matrix Equations and Hilbert's Tenth Problem. - Paul Bell; Vesa Halava; Tero Harju; Juhani Karhumäki; Igor Potapov (Int. J. Algebra Comput., 2008)

On undecidability bounds for matrix decision problems. - Paul Bell; Igor Potapov (Theor. Comput. Sci., 2008)

The Identity Correspondence Problem and Its Applications. - Paul Bell; Igor Potapov (ISAAC, 2009)

On the Joint Spectral Radius for Bounded Matrix Languages. - Paul Bell; Vesa Halava; Mika Hirvensalo (RP, 2010)

On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups. - Paul C. Bell; Igor Potapov (Int. J. Found. Comput. Sci., 2010)

The continuous Skolem-Pisot problem. - Paul C. Bell; Jean-Charles Delvenne; Raphaël M. Jungers; Vincent D. Blondel (Theor. Comput. Sci., 2010)

Mortality for 2×2 Matrices Is NP-Hard. - Paul C. Bell; Mika Hirvensalo; Igor Potapov (MFCS, 2012)

On the Computational Complexity of Matrix Semigroup Problems. - Paul C. Bell; Igor Potapov (Fundam. Informaticae, 2012)

Reachability Problems for Hierarchical Piecewise Constant Derivative Systems. - Paul C. Bell; Shang Chen (RP, 2013)

Decision Problems for Probabilistic Finite Automata on Bounded Languages. - Paul C. Bell; Vesa Halava; Mika Hirvensalo (Fundam. Informaticae, 2013)

Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives. - Paul C. Bell; Shang Chen; Lisa M. Jackson (RP, 2014)

Report on BCTCS 2014. - Paul Bell; Daniel Reidenbach (Bull. EATCS, 2014)

Factorization in Formal Languages. - Paul C. Bell; Daniel Reidenbach; Jeffrey O. Shallit (DLT, 2015)

Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines. - Paul C. Bell; Prudence W. H. Wong (J. Comb. Optim., 2015)

Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages. - Paul C. Bell; Shang Chen; Lisa M. Jackson (LATA, 2016)

On the decidability and complexity of problems for restricted hierarchical hybrid systems. - Paul C. Bell; Shang Chen; Lisa M. Jackson (Theor. Comput. Sci., 2016)

A Comparison of Distance Metrics in Semi-supervised Hierarchical Clustering Methods. - Abeer Aljohani; Daphne Teck Ching Lai; Paul C. Bell; Eran A. Edirisinghe (ICIC (3), 2017)

The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete. - Paul C. Bell; Mika Hirvensalo; Igor Potapov (SODA, 2017)

Acceptance Ambiguity for Quantum Automata. - Paul C. Bell; Mika Hirvensalo (MFCS, 2019)

Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. - Paul C. Bell; Igor Potapov; Pavel Semukhin (CoRR, 2019)

Freeness properties of weighted and probabilistic automata over bounded languages. - Paul C. Bell; Shang Chen; Lisa M. Jackson (Inf. Comput., 2019)

Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. - Paul C. Bell; Pavel Semukhin (CONCUR, 2020)

Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata. - Paul C. Bell; Pavel Semukhin (CoRR, 2020)

Unique decipherability in formal languages. - Paul C. Bell; Daniel Reidenbach; Jeffrey O. Shallit (Theor. Comput. Sci., 2020)

On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. - Paul C. Bell; Igor Potapov; Pavel Semukhin (Inf. Comput., 2021)

On injectivity of quantum finite automata. - Paul C. Bell; Mika Hirvensalo (J. Comput. Syst. Sci., 2021)

Towards Uniform Online Spherical Tessellations. - Paul C. Bell; Igor Potapov (Discret. Comput. Geom., 2022)

Preface. - Paul C. Bell; Igor Potapov; Sylvain Schmitz; Patrick Totzke (Fundam. Informaticae, 2022)

Polynomially ambiguous probabilistic automata on restricted languages. - Paul C. Bell (J. Comput. Syst. Sci., 2022)

On the Identity and Group Problems for Complex Heisenberg Matrices. - Paul C. Bell; Reino Niskanen; Igor Potapov; Pavel Semukhin (RP, 2023)

Decision Questions for Probabilistic Automata on Small Alphabets. - Paul C. Bell; Pavel Semukhin (Log. Methods Comput. Sci., 2023)

The membership problem for subsemigroups of GL2(Z) is NP-complete. - Paul C. Bell; Mika Hirvensalo; Igor Potapov (Inf. Comput., 2024)