transitionTablesContinuous.rb

# given a transition table, calculate the function that interpolates this table making a continuous model
# if the table is not of full size, assume 0 for the missing inputs
#   A(t) 	B(t) 	C(t+1)
#   0	   0	   0 
#   0	   1	   0 
#   1	   0	   0 
#   1	   1	   1
# generates f_C = A*B
# the (t)'s are not necessary, just to clarify, that the last column is the output variable


require 'pp'


unless ARGV.size == 2
  puts "Usage: ruby transitionTables.rb p_value tableFile "
  exit 0
end


p_value = ARGV[0]
tableFile = ARGV[1]

#puts "hello"
#puts tableFile
puts "<br>"

p = p_value.to_i

if p == -1 
  puts "<font color=red>Error. Number of nodes should be a positive integer.</font color=red><br>"
  exit 1
end

# read the complete input file
s = IO.readlines(tableFile)

varNames = s.shift    #get the first line
numLines = s.size
#puts "number of lines #{s.size}<br>"
#puts "names: #{varNames} <br>"

inputNames = varNames.split(/\s+/)
# this is different from not continuous case. We want the output variable to be an element in the ringt, because there's an implicit self loop. Thus, we use the last element in the array but we do not remove it. 
outputName = inputNames.last
#outputName = inputNames.pop
n = inputNames.size - 1

if (numLines > p ** n )
  puts "<font color=red>Error. Number of rows in the table should be at most p^n.</font color=red><br>"
  exit 1
end

# keys of the hash are the integers corresonding to the p-ary string
# values are the output value as determined by transition table
outputs = Hash.new

# use a default value of 0, this should also put the keys in order
(p**n).times {|i|
  outputs[i] = 0
}
 
s.each{ |line|
    #puts "this is one line #{line} <br>"
    inputs = line.split(/\s+/)
    output = inputs.pop
    if (inputs.size != n ) 
      puts "<font color=red>Error. Number of inputs should be n.</font color=red><br>"
      exit 1
    end
    nn = inputs.to_s.to_i(p)
    #puts "outputs[#{nn}] = #{output}<br>"
    outputs[nn] = output
}

#pp outputs
#pp outputs.sort

# prepare strings to run M2

LL = inputNames.collect{ |var| 
  var.gsub!(/\(.*\)/, "")
  "\"#{var}\", " 
}.to_s
LL.chop!  #cut off last blank
LL.chop!  #cut off last comma

vals = outputs.sort.collect{ |pairs|  "\"#{pairs.last}\", " }.to_s
#puts vals
vals.chop!  #cut off last blank
vals.chop!

#interpolate (List, ZZ, List) := (L, p, vals) 
#puts "M2 indicatorFunc.m2 --stop --no-debug --silent -q -e 'interpolate( {#{LL} }, #{p}, {#{vals}} ); exit 0'<br>"
m2_result = `cd lib/M2code; M2 indicatorFunc.m2 --stop --no-debug --silent -q -e 'interpolateContinuous( {#{LL} }, #{p}, {#{vals}} ); exit 0'`

puts "The following function interpolates the transition table making a continuous model: <br>"
puts "f_#{outputName.gsub(/\(.*\)/, "")} = #{m2_result}<br><br>"


exit 0