Liverpool Skyline

School of Computer Science and Mathematics

Dr Paul Bell

Dr Paul Bell

Telephone: 0151 231 2091

ORCID

Biography

Degrees

2007, University of Liverpool, UK, PhD, Computer Science
2004, University of Liverpool, United Kingdom, BSc, Computer Science

Publications

Conference publication

Bell PC, Semukhin P. 2020. Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata Konnov I, Kovacs L. The 31st International Conference on Concurrency Theory (CONCUR 2020) Public Url

Bell PC, Potapov I, Semukhin P. 2019. On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond Leibniz International Proceedings in Informatics, LIPIcs, 138 DOI

Bell PC, Hirvensalo M. 2019. Acceptance ambiguity for quantum automata Leibniz International Proceedings in Informatics, LIPIcs, 138 DOI Author Url

Bell PC, Potapov I. 2019. Towards Uniform Online Spherical Tessellations Primiero G, Martin B, Paulusma D, Manea F. Lecture Notes in Computer Science, Computability in Europe :120-131 DOI Public Url

Bell PC. 2019. Polynomially Ambiguous Probabilistic Automata on Restricted Languages Baier C, Chatzigiannakis I, Flocchini P, Leonardi S. LIPIcs : Leibniz International Proceedings in Informatics, International Colloquium on Automata, Languages and Programming (ICALP) 132 :1-14 DOI Public Url

Bell PC, Hirvensalo M, Potapov I. 2017. The Identity Problem for Matrix Semigroups in SL2(Z) is NP-complete PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) :187-206 DOI Author Url Publisher Url

Aljohani A, Lai DTC, Bell PC, Edirisinghe EA. 2017. A Comparison of Distance Metrics in Semi-supervised Hierarchical Clustering Huang DS, Hussain A, Han K, Gromiha MM. INTELLIGENT COMPUTING METHODOLOGIES, ICIC 2017, PT III, 13th International Conference on Intelligent Computing (ICIC) 10363 :719-731 DOI Author Url

Bell PC, Chen S, Jackson L. 2016. Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages Dediu AH, Janousek J, MartinVide C, Truthe B. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 10th International Conference on Language and Automata Theory and Applications (LATA) 9618 :493-505 DOI Author Url

Bell PC, Reidenbach D, Shallit J. 2015. Factorization in Formal Languages Potapov I. DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 19th International Conference on Developments in Language Theory (DLT) 9168 :97-107 DOI Author Url

Bell PC, Chen S, Jackson L. 2014. Reachability and mortality problems for restricted hierarchical piecewise constant derivatives Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8762 :32-44 DOI

Bell PC, Chen S. 2013. Reachability Problems for Hierarchical Piecewise Constant Derivative Systems Abdulla PA, Potapov I. REACHABILITY PROBLEMS, 7th International Workshop on Reachability Problems (RP) 8169 :46-58 DOI Author Url

Bell PC, Hirvensalo M, Potapov I. 2012. Mortality for 2 x 2 Matrices Is NP-Hard Rovan B, Sassone V, Widmayer P. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 37th International Symposium on Mathematical Foundations of Computer Science, (MFCS) 7464 :148-159 DOI Author Url

Bell PC, Wong PWH. 2011. Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines Ogihara M, Tarui J. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 8th Annual Conference on Theory and Applications of Models of Computation (TAMC) 6648 :27-36 DOI Author Url

Bell PC, Halava V, Hirvensalo M. 2010. On the Joint Spectral Radius for Bounded Matrix Languages Kucera A, Potapov I. REACHABILITY PROBLEMS, 4th International Workshop on Reachability Problems 6227 :91-+ DOI Author Url

Bell PC, Potapov I. 2009. The Identity Correspondence Problem and Its Applications Dong Y, Du DZ, Ibarra O. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 20th International Symposium on Algorithms and Computations (ISAAC 2009) 5878 :657-667 DOI Author Url

Bell P, Potapov I. 2008. Periodic and infinite traces in matrix semigroups Geffert V, Karhumaki J, Bertoni A, Preneel B, Navrat P, Bielikova M. SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 34th Conference on Current Trends in Theory and Practice of Computer Science 4910 :148-+ DOI Author Url

Bell P, Potapov I. 2007. Reachability problems in quaternion matrix and rotation semigroups Kucera L, Kucera A. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 32nd International Symposium on Mathematical Foundations of Computer Science 4708 :346-+ DOI Author Url

Bell P, Potapov I. 2006. Lowering undecidability bounds for decision questions in matrices Ibarra OH, Dang Z. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 10th International Conference on Developments in Language Theory 4036 :375-385 DOI Author Url

Bell P, Potapov I. 2005. On the membership of invertible diagonal matrices Felice CD, Restivo R. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 9th International Conference on Developments in Language Theory 3572 :146-157 DOI Author Url

Journal article

Bell P, Reidenbach D, Shallit J. 2020. Unique Decipherability in Formal Languages Theoretical Computer Science, 804 :149-160 DOI Public Url

Bell PC, Chen S, Jackson LM. 2019. Freeness Properties of Weighted and Probabilistic Automata over Bounded Languages Martin-Vide C, Truthe B. Information and Computation, DOI Author Url Publisher Url Public Url

Bell PC, Chen S, Jackson LM. 2016. On the decidability and complexity of problems for restricted hierarchical hybrid systems Theoretical Computer Science, 652 :47-63 DOI Author Url Publisher Url Public Url

Bell PC, Wong PWH. 2015. Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines JOURNAL OF COMBINATORIAL OPTIMIZATION, 29 :739-749 DOI Author Url

Bell PC, Halava V, Hirvensalo M. 2013. Decision Problems for Probabilistic Finite Automata on Bounded Languages Fundamenta Informaticae, 123 :1-14 DOI Author Url

Bell PC, Potapov I. 2012. On the Computational Complexity of Matrix Semigroup Problems Fundamenta Informaticae, 116 :1-13 DOI Author Url

Bell PC, 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 :963-978 DOI Author Url

Bell PC, Delvenne J-C, Jungers RM, Blondel VD. 2010. The continuous Skolem-Pisot problem THEORETICAL COMPUTER SCIENCE, 411 :3625-3634 DOI Author Url

Bell PC, Halava V, Harju T, Karhumaki J, Potapov I. 2008. Matrix Equations and Hilbert's Tenth Problem International Journal of Algebra and Computation, 18 :1231-1241 DOI

Bell P, Halava V, Harju T, Karhumaki J, Potapov I. 2008. MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 18 :1231-1241 DOI Author Url

Bell P, Potapov I. 2008. Reachability problems in quaternion matrix and rotation semigroups INFORMATION AND COMPUTATION, 206 :1353-1361 DOI Author Url

Bell P, Potapov I. 2008. On undecidability bounds for matrix decision problems THEORETICAL COMPUTER SCIENCE, 391 :3-13 DOI Author Url

Bell PC. 2008. A Note on the Emptiness of Semigroup Intersections Fundamenta Informaticae, 79 :1-4 Author Url

Bell P, Potapov I. 2007. On the membership of invertible diagonal and scalar matrices THEORETICAL COMPUTER SCIENCE, 372 :37-45 DOI Author Url