Lines Matching full:state
67 The algorithm works as a slightly modified finite state machine.
69 input (which work just like your regular finite state machine), and
73 tables - i.e. it behaves the same as a completely vanilla state
77 Each state is represented by a string. Thus, if the current state
78 is "am" and the next letter is "p", then the next state is "amp".
85 Each state is also associated with a (possibly null) "match"
88 is a right-justified substring of the state "amp", so it's numbers get
93 Because each state transition either consumes one input character
94 or shortens the state string by one character, the total number of
95 state transitions is linear in the length of the word.
