A diiferent approach to get a solution to string matching with O(n) time complexity.
-
Updated
Aug 31, 2019 - Java
#
string-matcher
Here are 3 public repositories matching this topic...
Project for Formal Languages & Automata Theory course.
-
Updated
May 5, 2016 - Java
An Implementation of Ukkonens 1990 linear-time algorithm for finding an approximate shortest superstring in Java. Also includes an extendable version of Aho Corasick's efficient string matcher.
-
Updated
Oct 24, 2021 - Java
Improve this page
Add a description, image, and links to the string-matcher topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the string-matcher topic, visit your repo's landing page and select "manage topics."