Skip to main content

Research Repository

Advanced Search

Outputs (2)

ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (2010)
Journal Article
Bell. (2010). ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS. International Journal of Foundations of Computer Science, 963 - 978. https://doi.org/10.1142/S0129054110007660

In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an identity pair by... Read More about ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS.

The continuous Skolem-Pisot problem (2010)
Journal Article
Bell. (2010). The continuous Skolem-Pisot problem. Theoretical Computer Science, 3625 - 3634. https://doi.org/10.1016/j.tcs.2010.06.005

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the nonnegativity... Read More about The continuous Skolem-Pisot problem.