1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.DS2012
Strongly sufficient sets and the distribution of arithmetic sequences in the 3x+1 graph
Keenan Monks, Kenneth G. Monks, Kenneth M. Monks +1
The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integer…
math.LO2010★ 1 cited
Closure properties of predicates recognized by deterministic and non-deterministic asynchronous automata
Maria Monks
Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite st…