TY - RPRT A1 - Sultanow, Eldar A1 - Volkov, Denis A1 - Cox, Sean T1 - Introducing a Finite State Machine for processing Collatz Sequences N2 - 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. KW - Collatz Conjecture KW - State Machine KW - Graph KW - Double Colored Edges Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-399223 ET - 1st version ER - TY - RPRT A1 - Sultanow, Eldar A1 - Volkov, Denis A1 - Cox, Sean T1 - Introducing a Finite State Machine for processing Collatz Sequences N2 - 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. KW - Collatz Conjecture KW - State Machine KW - Graph KW - Double Colored Edges Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-404738 ET - 2nd version ER -