Loading lib/ts_fsm.c +1 −1 Original line number Diff line number Diff line Loading @@ -11,7 +11,7 @@ * ========================================================================== * * A finite state machine consists of n states (struct ts_fsm_token) * representing the pattern as a finite automation. The data is read * representing the pattern as a finite automaton. The data is read * sequentially on an octet basis. Every state token specifies the number * of recurrences and the type of value accepted which can be either a * specific character or ctype based set of characters. The available Loading lib/ts_kmp.c +1 −1 Original line number Diff line number Diff line Loading @@ -27,7 +27,7 @@ * * [1] Cormen, Leiserson, Rivest, Stein * Introdcution to Algorithms, 2nd Edition, MIT Press * [2] See finite automation theory * [2] See finite automaton theory */ #include <linux/module.h> Loading Loading
lib/ts_fsm.c +1 −1 Original line number Diff line number Diff line Loading @@ -11,7 +11,7 @@ * ========================================================================== * * A finite state machine consists of n states (struct ts_fsm_token) * representing the pattern as a finite automation. The data is read * representing the pattern as a finite automaton. The data is read * sequentially on an octet basis. Every state token specifies the number * of recurrences and the type of value accepted which can be either a * specific character or ctype based set of characters. The available Loading
lib/ts_kmp.c +1 −1 Original line number Diff line number Diff line Loading @@ -27,7 +27,7 @@ * * [1] Cormen, Leiserson, Rivest, Stein * Introdcution to Algorithms, 2nd Edition, MIT Press * [2] See finite automation theory * [2] See finite automaton theory */ #include <linux/module.h> Loading