On Simon's string searching algorithm

DOI10.1016/0020-0190(93)90231-WzbMath0781.68068OpenAlexW2074791768MaRDI QIDQ685473

Christophe Hancart

Publication date: 17 October 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90231-w

zbMATH Keywords

finite automatastring matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Validating the Knuth-Morris-Pratt failure function, fast and online ⋮ String matching algorithms and automata ⋮ On-line string matching algorithms: survey and experimental results ⋮ How the character comparison order shapes the shift function of on-line pattern matching algorithms ⋮ Waiting time and complexity for matching patterns with automata ⋮ A New String Matching Algorithm ⋮ Minimisation of automata ⋮ An efficient null-free procedure for deciding regular language membership

Cites Work

• On the Exact Complexity of String Matching: Lower Bounds
• On the Exact Complexity of String Matching: Upper Bounds
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item