Finite Automata for Generalized Approach to Backward Pattern Matching

DOI10.1007/978-3-642-18098-9_6zbMath1297.68275OpenAlexW1513430197MaRDI QIDQ3073621

Jan Antoš, Bořivoj Melichar

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_6

zbMATH Keywords

classificationapproximate pattern matchingfinite automata theorybackward pattern matchingautomata construction

Mathematics Subject Classification ID

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

Cites Work

• A variation on the Boyer-Moore algorithm
• A fast string searching algorithm
• Efficient string matching
• String Processing and Information Retrieval
• Algorithms on Strings
• Unnamed Item
• Unnamed Item