• DOI:10.1007/978-3-642-20712-9_24
Corpus ID: 17075442

Orbits of Linear Maps and Regular Languages

@inproceedings{Tarasov2011OrbitsOL,
  title={Orbits of Linear Maps and Regular Languages},
  author={S. Tarasov and M. Vyalyi},
  booktitle={CSR},
  year={2011}
}

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed