String matching algorithms and automata

DOI10.1007/3-540-58131-6_61MaRDI QIDQ6183618zbMATH OpenFDO

Authors Imre Simon

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58131-6_61

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1045407
• scientific article; zbMATH DE number 1615293
• Waiting time and complexity for matching patterns with automata
• An analytical comparison of two string searching algorithms
• Simple Optimal String Matching Algorithm

Cites work

• Enumeration of bordered words, le langage de la vache-qui-rit
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 52125 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• On Simon's string searching algorithm
• Periods in strings
• String Matching in Real Time
• The smallest automaton recognizing the subwords of a text
• The Theory of Definite Automata

Cited in

(2)

• Validating the Knuth-Morris-Pratt failure function, fast and online
• Order preserving pattern matching on trees and DAGs

This page was built for publication: String matching algorithms and automata

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