Hi I have programmed my finite state automata string matching algorithm. However I am struggling to limit the alphabet to only two characters. My implementation looks similar to http://www.sanfoundry.com/cpp-program-perform-finite-state-automaton-based-search/.
The NO_OF_CHAR variable is stating the alphabet of the program. I am trying to limit this to only two characters {0,1} eg: 0101001. If anyone has knowledge of finite state automata, input would be appreciated.