@techreport{SultanowKochCox2020,
  author    = {Sultanow, Eldar and Koch, Christian and Cox, Sean},
  title     = {Collatz Sequences in the Light of Graph Theory},
  edition   = {Fifth version},
  doi       = {10.25932/publishup-48214},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-482140},
  pages     = {47},
  year      = {2020},
  abstract  = {It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that this tree covers all odd natural numbers. A structured reachability analysis is hitherto unavailable. This paper investigates the problem from a graph theory perspective. We define a tree that consists of nodes labeled with Collatz sequence numbers. This tree will be transformed into a sub-tree that only contains odd labeled nodes. Furthermore, we derive and prove several formulas that can be used to traverse the graph. The analysis covers the Collatz problem both in it's original form 3x + 1 as well as in the generalized variant kx + 1. Finally, we transform the Collatz graph into a binary tree, following the approach of Kleinnijenhuis, which could form the basis for a comprehensive proof of the conjecture.},
  language  = {en}
}
@techreport{SultanowVolkovCox2017,
  author    = {Sultanow, Eldar and Volkov, Denis and Cox, Sean},
  title     = {Introducing a Finite State Machine for processing Collatz Sequences},
  edition   = {2nd version},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-404738},
  pages     = {17},
  year      = {2017},
  abstract  = {The present work will introduce a Finite State Machine (FSM) that processes any Collatz Sequence; further, we will endeavor to investigate its behavior in relationship to transformations of a special infinite input. Moreover, we will prove that the machine's word transformation is equivalent to the standard Collatz number transformation and subsequently discuss the possibilities for use of this approach at solving similar problems. The benefit of this approach is that the investigation of the word transformation performed by the Finite State Machine is less complicated than the traditional number-theoretical transformation.},
  language  = {en}
}
@techreport{SultanowVolkovCox2017,
  author    = {Sultanow, Eldar and Volkov, Denis and Cox, Sean},
  title     = {Introducing a Finite State Machine for processing Collatz Sequences},
  edition   = {1st version},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-399223},
  year      = {2017},
  abstract  = {The present work will introduce a Finite State Machine (FSM) that processes any Collatz Sequence; further, we will endeavor to investigate its behavior in relationship to transformations of a special infinite input. Moreover, we will prove that the machine's word transformation is equivalent to the standard Collatz number transformation and subsequently discuss the possibilities for use of this approach at solving similar problems. The benefit of this approach is that the investigation of the word transformation performed by the Finite State Machine is less complicated than the traditional number-theoretical transformation.},
  language  = {en}
}