Automata, Languages, and Machines
Automata, Languages, and Machines
Hi-index | 0.89 |
We consider lattices of regular sets of non negative integers, i.e. of sets definable in Presburger arithmetic. We prove that if such a lattice is closed under decrement then it is also closed under many other functions: quotients by an integer, roots, etc. We characterize the family of such functions.