Commit 7433a8d6 authored by Randy Dunlap's avatar Randy Dunlap Committed by David S. Miller

textsearch: fix typos in library helpers

Fix spellos (typos) in textsearch library helpers.
Signed-off-by: default avatarRandy Dunlap <>
Signed-off-by: default avatarDavid S. Miller <>
parent 6cb3ece9
......@@ -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
......@@ -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>
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment