Paul Bell

According to our database, Paul Bell authored at least 39 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The membership problem for subsemigroups of GL2(Z) is NP-complete.

Paul C. Bell, Mika Hirvensalo, Igor Potapov

Inf. Comput., January, 2024

2023

On the Identity and Group Problems for Complex Heisenberg Matrices.

Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin

Proceedings of the Reachability Problems - 17th International Conference, 2023

2022

Preface.

Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke

Fundam. Informaticae, 2022

2021

On injectivity of quantum finite automata.

Paul C. Bell, Mika Hirvensalo

J. Comput. Syst. Sci., 2021

Decision Questions for Probabilistic Automata on Small Alphabets.

Paul C. Bell, Pavel Semukhin

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Unique decipherability in formal languages.

Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit

Theor. Comput. Sci., 2020

Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata.

Paul C. Bell, Pavel Semukhin

CoRR, 2020

Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.

Paul C. Bell, Pavel Semukhin

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Freeness properties of weighted and probabilistic automata over bounded languages.

Paul C. Bell, Shang Chen, Lisa M. Jackson

Inf. Comput., 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

On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond.

Paul C. Bell, Igor Potapov, Pavel Semukhin

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Acceptance Ambiguity for Quantum Automata.

Paul C. Bell, Mika Hirvensalo

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Polynomially Ambiguous Probabilistic Automata on Restricted Languages.

Paul C. Bell

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Towards Uniform Online Spherical Tessellations.

Paul C. Bell, Igor Potapov

Proceedings of the Computing with Foresight and Industry, 2019

2017

The Identity Problem for Matrix Semigroups in SL₂(ℤ) is NP-complete.

Paul C. Bell, Mika Hirvensalo, Igor Potapov

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A Comparison of Distance Metrics in Semi-supervised Hierarchical Clustering Methods.

Abeer Aljohani, Daphne Teck Ching Lai, Paul C. Bell, Eran A. Edirisinghe

Proceedings of the Intelligent Computing Methodologies - 13th International Conference, 2017

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

Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages.

Paul C. Bell, Shang Chen, Lisa M. Jackson

Proceedings of the Language and Automata Theory and Applications, 2016

2015

Factorization in Formal Languages.

Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014

Report on BCTCS 2014.

Paul Bell, Daniel Reidenbach

Bull. EATCS, 2014

Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives.

Paul C. Bell, Shang Chen, Lisa M. Jackson

Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013

Decision Problems for Probabilistic Finite Automata on Bounded Languages.

Paul C. Bell, Vesa Halava, Mika Hirvensalo

Fundam. Informaticae, 2013

Reachability Problems for Hierarchical Piecewise Constant Derivative Systems.

Paul C. Bell, Shang Chen

Proceedings of the Reachability Problems - 7th International Workshop, 2013

2012

On the Computational Complexity of Matrix Semigroup Problems.

Paul C. Bell, Igor Potapov

Fundam. Informaticae, 2012

Mortality for 2×2 Matrices Is NP-Hard.

Paul C. Bell, Mika Hirvensalo, Igor Potapov

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines.

Paul C. Bell, Prudence W. H. Wong

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

The continuous Skolem-Pisot problem.

Paul C. Bell, Jean-Charles Delvenne, Raphaël M. Jungers, Vincent D. Blondel

Theor. Comput. Sci., 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

On the Joint Spectral Radius for Bounded Matrix Languages.

Paul Bell, Vesa Halava, Mika Hirvensalo

Proceedings of the Reachability Problems, 4th International Workshop, 2010

2009

The Identity Correspondence Problem and Its Applications.

Paul Bell, Igor Potapov

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

On undecidability bounds for matrix decision problems.

Paul Bell, Igor Potapov

Theor. Comput. Sci., 2008

Matrix Equations and Hilbert's Tenth Problem.

Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov

Int. J. Algebra Comput., 2008

Periodic and Infinite Traces in Matrix Semigroups.

Paul Bell, Igor Potapov

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007

Computational problems in matrix semigroups.

Paul C. Bell

PhD thesis, 2007

On the membership of invertible diagonal and scalar matrices.

Paul Bell, Igor Potapov

Theor. Comput. Sci., 2007

A Note on the Emptiness of Semigroup Intersections.

Paul Bell

Fundam. Informaticae, 2007

Reachability Problems in Quaternion Matrix and Rotation Semigroups.

Paul Bell, Igor Potapov

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Lowering Undecidability Bounds for Decision Questions in Matrices.

Paul Bell, Igor Potapov

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

On the Membership of Invertible Diagonal Matrices.

Paul Bell, Igor Potapov

Proceedings of the Developments in Language Theory, 9th International Conference, 2005