Journal of the ACM (JACM)
On Models of a Nondeterministic Computation
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Lowering undecidability bounds for decision questions in matrices
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The orbit problem in higher dimensions
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The chamber hitting problem (CHP) for linear maps consists in checking whether an orbit of a linear map specified by a rational matrix hits a given rational polyhedral set. The CHP generalizes some wellknown open computability problems about linear recurrent sequences (e.g., the Skolem problem, the nonnegativity problem). It is recently shown that the CHP is Turing equivalent to checking whether an intersection of a regular language and the special language of permutations of binary words (the permutation filter) is nonempty (PB-realizability problem). In this paper we present some decidable and undecidable problems closely related to PB-realizability problem thus demonstrating its 'borderline' status with respect to computability.