Develop and implement an ADT for preprocessing a string to s

Develop and implement an ADT for preprocessing a
string to support efficiently answering queries of the form How many times does a given
k-gram appear ? Each query should take time proportional to k log N in the worst case,
where N is the length of the string.(Please give solution in java)

Solution

The determine illustrates a deterministic finite automaton the usage of a nation diagram. in the automaton, there are three states: S0, S1, and S2 (denoted graphically through circles). The automaton takes a finite collection of 0s and 1s as enter. For each state, there\'s a transition arrow leading out to a next nation for both 0 and 1. Upon analyzing a symbol, a DFA jumps deterministically from one state to another through following the transition arrow. as an example, if the automaton is currently in kingdom S0 and the modern input symbol is 1, then it deterministically jumps to country S1. A DFA has a begin state (denoted graphically by using an arrow coming in from nowhere) wherein computations start, and a set of receive states (denoted graphically by way of a double circle) which help define when a computation is a hit.