# # @ Javier Felipe Toribio 2020-05-05 # # challenge by Oma Falk # # Finite State Machine # # This a finite state machine # State A is start and end. # From State A the character 1 leads to State B # while 0 will keep State A. # A binary representation of a number matches # the fsm, if its last character leads # to state A. # # Example 101101 matches because A1B0C1C1C0B1A # # Code that fsm, test all numbers from 1 to 100 # and find out what kind of numbers this fsm # describes # # Start # | # v ---1-> ---0-> # 0 <--> (A) (B) (C) <--> 0 # <--1-- <--0-- # class FiniteStateMachine def initialize(input) @state = nil @input = input @bits = input.split("").map(&:to_i) @log = "" end def next_state(klass=A) @state = klass.new(self) @log << "(" + @state.class.to_s + ")" unless @bits.empty? digit = @bits.shift @log << " -- #{digit} --> " @state.next(digit) else show_result() end end private def show_result fits = @state.is_a? A puts <<~END #{@log} Number : #{@input.to_i(2)} Bits : #{@input} #{fits ? 'Fits' : 'Doesn\'t fit' } Finite State Machine #{'-'*40} END end end class State def initialize(machine) @machine=machine end def next(digit) [self.method(:zero), self.method(:one)][digit].call end end class A < State def zero @machine.next_state(A) end def one @machine.next_state(B) end end class B < State def zero @machine.next_state(C) end def one @machine.next_state(A) end end class C < State def zero @machine.next_state(B) end def one @machine.next_state(C) end end # MAIN PROGRAM (1..100).each do |number| fsm = FiniteStateMachine.new(number.to_s(2)) fsm.next_state end

[challenge] finite state machine