Orbits of Linear Maps and Regular Languages

  title={Orbits of Linear Maps and Regular Languages},
  author={S. Tarasov and M. Vyalyi},
  • S. Tarasov, M. Vyalyi
  • Published in CSR 2011
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    10 Citations

    Figures and Topics from this paper

    Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
    • 43
    • PDF
    On expressive power of regular realizability problems
    • M. Vyalyi
    • Mathematics, Computer Science
    • Probl. Inf. Transm.
    • 2013
    • 3
    The Polyhedron-Hitting Problem
    • 16
    • PDF
    Positivity Problems for Low-Order Linear Recurrence Sequences
    • 74
    • PDF
    From Decidability to Undecidability by Considering Regular Sets of Instances
    • 1
    • PDF
    Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
    • 2
    • PDF
    On the Complexity of the Orbit Problem
    • 23
    • PDF


    An integer analogue of Carathéodory's theorem
    • 78
    • PDF
    Lowering Undecidability Bounds for Decision Questions in Matrices
    • 3
    On Models of a Nondeterministic Computation
    • M. Vyalyi
    • Mathematics, Computer Science
    • CSR
    • 2009
    • 5
    • PDF
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 47,260
    • PDF
    What Is Enumerative Combinatorics
    • 3,349
    Context-free languages
    • 270
    • PDF
    Rational series and their languages
    • 793