feat: Implement Finite Automata Algorithm for Pattern Searching #342
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull request adds a new implementation of the Finite Automaton pattern searching algorithm in Python. The code provides both a basic and an optimized approach to construct the automaton for efficient pattern matching, along with example usages demonstrating its functionality.
Algorithm implementation:
FiniteAutomatonclass infinite_automaton_pattern_search.py, which builds a deterministic finite automaton (DFA) for a given pattern and supports searching for all pattern occurrences in a text.build_optimized_transition_functionfor improved performance, especially with large alphabets.finite_automaton_searchthat combines pattern and text alphabets, builds the automaton, and returns all match positions.Documentation and examples: