Which 开发者_Go百科is the best or easiest method for determining equivalence between two automata?
My goal is to implement a transition function in OCaml which takes in input an state and a character is returns a positive Boolean formula(including true and false).
I am currently struggling with a particularly obnoxious string format that I have to parse. The strings can contain substrings that denote a variable property that has to be resolved. Imagine somethin
I am thinking about implementing a program with finite state automaton in an OOP language like Java or C++.
I want to put State objects (which are HashMaps with Character as key and State as Value into an ArrayList named allStates. Should I override the equals and hashCode methods here? Why? How?
加载中,请稍侯......