On Simon's string searching algorithm

DOI10.1016/0020-0190(93)90231-WzbMATH Open0781.68068OpenAlexW2074791768MaRDI QIDQ685473FDOQ685473

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)

Cites Work

• Fast Pattern Matching in Strings
• On the Exact Complexity of String Matching: Lower Bounds
• On the Exact Complexity of String Matching: Upper Bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• On the Exact Complexity of String Matching: Upper Bounds
• Waiting time and complexity for matching patterns with automata
• A New String Matching Algorithm
• On-line string matching algorithms: survey and experimental results
• Minimisation of automata
• Exact bounds on the complexity of sequential string matching algorithms
• String matching algorithms and automata
• Validating the Knuth-Morris-Pratt failure function, fast and online
• An efficient null-free procedure for deciding regular language membership
• On Simon's congruence closure of a string
• How the character comparison order shapes the shift function of on-line pattern matching algorithms

Recommendations

• Efficient comparison based string matching 👍 👎
• Exact bounds on the complexity of sequential string matching algorithms 👍 👎
• On the Exact Complexity of String Matching: Lower Bounds 👍 👎
• On the Exact Complexity of String Matching: Upper Bounds 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On Simon's string searching algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685473)