Implement pattern matching algorithms

Create implementations for pattern matching algorithms:

## String matching algorithms:
- Naive string matching
- Knuth-Morris-Pratt (KMP)
- Boyer-Moore
- Rabin-Karp
- Aho-Corasick
- Z algorithm

## Regular expression operations:
- Basic regex engine
- Thompson's construction (NFA)
- Powerset construction (DFA)
- Subset construction

## Applications:
- DNA sequence matching
- Plagiarism detection
- Spell checkers
- Search engines
- Log analysis

## Requirements:
- Provide detailed complexity analysis
- Include visualizations of algorithm execution
- Create comprehensive test cases
- Document practical applications

This collection will demonstrate efficient techniques for substring searching and pattern matching, which are fundamental in text processing, bioinformatics, and many other domains.