Personal information

Websites & social links

Work Homepage

Other IDs

Scopus Author ID: 7402587606

Keywords

Computability and complexity theory, Automated verification, Graph theory, Formal language theory, Matrix semigroups, Computational geometry

Countries

United Kingdom

Activities

Collapse all

Employment (7)

Keele University: Newcastle-under-Lyme, Staffordshire, GB

2022-06-13 to present | Reader in Computability and Automata Theory (Computing and Mathematics)
Employment
Source: Self-asserted source
Paul C Bell

Liverpool John Moores University: Liverpool, Liverpool, GB

2017-04-03 to 2022-06-10 | Senior Lecturer (Computer Science)
Employment
Source: Self-asserted source
Paul C Bell

Loughborough University: Loughborough, Leicestershire, GB

2011-01-04 to 2017-03-31 | Lecturer (Computer Science)
Employment
Source: Self-asserted source
Paul C Bell

University of Liverpool: Liverpool, Liverpool, GB

2009-09-01 to 2010-12-01 | University Teacher (Computer Science)
Employment
Source: Self-asserted source
Paul C Bell

University of Liverpool: Liverpool, Liverpool, GB

2008-09-01 to 2009-07-15 | Postdoctoral Associate (Computer Science)
Employment
Source: Self-asserted source
Paul C Bell

Universite Catholique de Louvain Faculte des Sciences: Louvain-la-Neuve, BE

2008-01-01 to 2008-08-30 | Postdoctoral researcher (Mathematics and Engineering)
Employment
Source: Self-asserted source
Paul C Bell

Turun Yliopisto: Turku, FI

2007-08-01 to 2008-01-01 | Postdoctoral Researcher (Department of Mathematics and Statistics)
Employment
Source: Self-asserted source
Paul C Bell

Education and qualifications (2)

University of Liverpool: Liverpool, Liverpool, GB

2004-10-01 to 2007-07-15 | PhD (Computer Science)
Education
Source: Self-asserted source
Paul C Bell

University of Liverpool: Liverpool, Liverpool, GB

2001-10-01 to 2004-06-01 | BSc (Computer Science)
Education
Source: Self-asserted source
Paul C Bell

Professional activities (1)

Loughborough University: Loughborough, Leicestershire, GB

2017-04-01 to present | Visiting Fellow (Computer Science)
Invited position
Source: Self-asserted source
Paul C Bell

Works (37)

Polynomially ambiguous probabilistic automata on restricted languages

Journal of Computer and System Sciences
2022-08 | Journal article
DOI: 10.1016/j.jcss.2022.02.002
Part of ISSN: 0022-0000
Source: Self-asserted source
Paul C Bell

Towards Uniform Online Spherical Tessellations

Discrete & Computational Geometry
2022-06 | Journal article
DOI: 10.1007/s00454-022-00384-x
Part of ISSN: 0179-5376
Part of ISSN: 1432-0444
Source: Self-asserted source
Paul C Bell

Decision Questions for Probabilistic Automata on Small Alphabets

46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
2021 | Conference paper
DOI: 10.4230/LIPICS.MFCS.2021.15
Source: Self-asserted source
Paul C Bell

On injectivity of quantum finite automata

Journal of Computer and System Sciences
2021-12 | Journal article
DOI: 10.1016/j.jcss.2021.05.002
Part of ISSN: 0022-0000
Source: Self-asserted source
Paul C Bell

On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond

Information and Computation
2021-12 | Journal article
DOI: 10.1016/j.ic.2021.104736
Part of ISSN: 0890-5401
Source: Self-asserted source
Paul C Bell

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

31st International Conference on Concurrency Theory (CONCUR 2020)
2020 | Conference paper
DOI: 10.4230/LIPICS.CONCUR.2020.22
Source: Self-asserted source
Paul C Bell

Unique decipherability in formal languages

Theoretical Computer Science
2020-01 | Journal article
DOI: 10.1016/j.tcs.2019.11.022
Part of ISSN: 0304-3975
Source: Self-asserted source
Paul C Bell

Freeness properties of weighted and probabilistic automata over bounded languages

Information and Computation
2019-12 | Journal article
DOI: 10.1016/j.ic.2019.104440
Part of ISSN: 0890-5401
Source: Self-asserted source
Paul C Bell

Acceptance Ambiguity for Quantum Automata

44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
2019-08 | Conference paper
ARXIV: 1907.01471
Source: Self-asserted source
Paul C Bell

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

44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
2019-08 | Conference paper
Source: Self-asserted source
Paul C Bell

Polynomially Ambiguous Probabilistic Automata on Restricted Languages

46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
2019-07-09 | Conference paper
DOI: 10.4230/LIPICS.ICALP.2019.105
Source: Self-asserted source
Paul C Bell

Towards Uniform Online Spherical Tessellations

Computability in Europe (CiE 2019)
2019-06-19 | Conference paper
DOI: 10.1007/978-3-030-22996-2_11
Source: Self-asserted source
Paul C Bell

A comparison of distance metrics in semi-supervised hierarchical clustering methods

International Conference on Intelligent Computing (ICIC 2017)
2017 | Conference paper
DOI: 10.1007/978-3-319-63315-2_63
EID:

2-s2.0-85028006755
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

The identity problem for matrix semigroups in SL2(Z) is NP-complete

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)
2017 | Conference paper
EID:

2-s2.0-85016194606
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

On the decidability and complexity of problems for restricted hierarchical hybrid systems

Theoretical Computer Science
2016 | Journal article
DOI: 10.1016/j.tcs.2016.09.003
EID:

2-s2.0-84992616366
Contributors: Bell, P.C.; Chen, S.; Jackson, L.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

Scalar ambiguity and freeness in matrix semigroups over bounded languages

Language and Automata Theory and Applications (LATA 2016)
2016-02-26 | Conference paper
DOI: 10.1007/978-3-319-30000-9_38
EID:

2-s2.0-84960369748
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

Journal of Combinatorial Optimization
2015 | Journal article
DOI: 10.1007/s10878-013-9618-8
EID:

2-s2.0-84926279372
Contributors: Bell, P.C.; Wong, P.W.H.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

Factorization in formal languages

Developments in Language Theory (DLT 2015)
2015-07-18 | Conference paper
DOI: 10.1007/978-3-319-21500-6_7
EID:

2-s2.0-84947079882
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

Reachability and mortality problems for restricted hierarchical piecewise constant derivatives

Reachability Problems (RP 2014)
2014 | Conference paper
EID:

2-s2.0-84921381769
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

Decision problems for probabilistic finite automata on bounded languages

Fundamenta Informaticae
2013 | Journal article
DOI: 10.3233/FI-2013-797
EID:

2-s2.0-84876245168
Contributors: Bell, P.C.; Halava, V.; Hirvensalo, M.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

Reachability problems for hierarchical piecewise constant derivative systems

Reachability Problems (RP 2013)
2013 | Conference paper
DOI: 10.1007/978-3-642-41036-9_6
EID:

2-s2.0-84886429025
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

Mortality for 2 ×2 matrices is NP-hard

Mathematical Foundations of Computer Science (MFCS 2012)
2012 | Conference paper
DOI: 10.1007/978-3-642-32589-2_16
EID:

2-s2.0-84865013349
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

On the computational complexity of matrix semigroup problems

Fundamenta Informaticae
2012 | Journal article
DOI: 10.3233/FI-2012-663
EID:

2-s2.0-84861417685
Contributors: Bell, P.C.; Potapov, I.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

Theory and Applications of Models of Computation (TAMC 2011)
2011 | Conference paper
DOI: 10.1007/978-3-642-20877-5_4
EID:

2-s2.0-79955752777
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

On the joint spectral radius for bounded matrix languages

Reachability Problems (RP 2010)
2010 | Conference paper
DOI: 10.1007/978-3-642-15349-5_6
EID:

2-s2.0-78049245849
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups

International Journal of Foundations of Computer Science
2010 | Journal article
DOI: 10.1142/S0129054110007660
EID:

2-s2.0-78649397327
Contributors: Bell, P.C.; Potapov, I.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

The continuous Skolem-Pisot problem

Theoretical Computer Science
2010 | Journal article
DOI: 10.1016/j.tcs.2010.06.005
EID:

2-s2.0-77956095225
Contributors: Bell, P.C.; Delvenne, J.-C.; Jungers, R.M.; Blondel, V.D.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

The identity correspondence problem and its applications

International Symposium on Algorithms and Computation (ISAAC 2009)
2009 | Conference paper
DOI: 10.1007/978-3-642-10631-6_67
EID:

2-s2.0-75649115374
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

Matrix equations and Hilbert's tenth problem

International Journal of Algebra and Computation
2008 | Journal article
DOI: 10.1142/S0218196708004925
EID:

2-s2.0-58149229469
Contributors: Bell, P.; Halava, V.; Harju, T.; KarhumÄki, J.; Potapov, I.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

On undecidability bounds for matrix decision problems

Theoretical Computer Science
2008 | Journal article
DOI: 10.1016/j.tcs.2007.10.025
EID:

2-s2.0-38149065182
Contributors: Bell, P.; Potapov, I.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

Periodic and infinite traces in matrix semigroups

International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2008)
2008 | Conference paper
EID:

2-s2.0-38549141908
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

Reachability problems in quaternion matrix and rotation semigroups

Information and Computation
2008 | Journal article
DOI: 10.1016/j.ic.2008.06.004
EID:

2-s2.0-53449101772
Contributors: Bell, P.; Potapov, I.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

A note on the emptiness of semigroup intersections

Fundamenta Informaticae
2007 | Journal article
EID:

2-s2.0-34548651884
Contributors: Bell, P.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

On the membership of invertible diagonal and scalar matrices

Theoretical Computer Science
2007 | Journal article
DOI: 10.1016/j.tcs.2006.11.011
EID:

2-s2.0-33846898707
Contributors: Bell, P.; Potapov, I.
Source: Self-asserted source
Paul C Bell via Scopus - Elsevier

Reachability problems in quaternion matrix and rotation semigroups

Mathematical Foundations of Computer Science (MFCS 2007)
2007 | Conference paper
EID:

2-s2.0-38049032528
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

Lowering undecidability bounds for decision questions in matrices

International Conference on Developments in Language Theory (DLT 2006)
2006 | Conference paper
DOI: 10.1007/11779148_34
EID:

2-s2.0-33746210759
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

On the membership of invertible diagonal matrices

Developments in Language Theory (DLT 2005)
2005 | Conference paper
EID:

2-s2.0-26444601225
Source: Self-asserted source
Paul C Bell
grade
Preferred source (of 2)‎

Peer review (4 reviews for 3 publications/grants)

Review activity for Information and computation. (1)
Review activity for Information processing letters. (2)
Review activity for Theory of computing systems. (1)
How many people are using ORCID?