i++// Advance to next character (if we aren't at a 0-state, which doesn't match anything), so that we can check for transitions. If we advance at a 0-state, we will never get a chance to match the first character
}
// TODO - If start state is kleene star, try to match the next state
startingFrom:=i
currentStates=append(currentStates,start)
// Main loop
fori<len(str){
foundPath=false
zeroStates:=make([]*State,0)
// Keep taking zero-states, until there are no more left to take
// Recursion - match with rest of string if we have nowhere to go. If we haven't moved in the string, increment the counter by 1 to ensure we don't keep trying the same string over and over