3 |
3 |
4 %% Created for CS TAN at 2022-05-23 18:43:50 +0100 |
4 %% Created for CS TAN at 2022-05-23 18:43:50 +0100 |
5 |
5 |
6 |
6 |
7 %% Saved with string encoding Unicode (UTF-8) |
7 %% Saved with string encoding Unicode (UTF-8) |
|
8 |
|
9 |
|
10 |
|
11 |
|
12 %% back-references-------------------- |
|
13 @incollection{AHO1990255, |
|
14 title = {CHAPTER 5 - Algorithms for Finding Patterns in Strings}, |
|
15 editor = {JAN {VAN LEEUWEN}}, |
|
16 booktitle = {Algorithms and Complexity}, |
|
17 publisher = {Elsevier}, |
|
18 address = {Amsterdam}, |
|
19 pages = {255-300}, |
|
20 year = {1990}, |
|
21 series = {Handbook of Theoretical Computer Science}, |
|
22 isbn = {978-0-444-88071-0}, |
|
23 doi = {https://doi.org/10.1016/B978-0-444-88071-0.50010-2}, |
|
24 url = {https://www.sciencedirect.com/science/article/pii/B9780444880710500102}, |
|
25 author = {Alfred V. AHO}, |
|
26 abstract = {Publisher Summary |
|
27 This chapter discusses the algorithms for solving string-matching problems that have proven useful for text-editing and text-processing applications. String pattern matching is an important problem that occurs in many areas of science and information processing. In computing, it occurs naturally as part of data processing, text editing, term rewriting, lexical analysis, and information retrieval. Many text editors and programming languages have facilities for matching strings. In biology, string-matching problems arise in the analysis of nucleic acids and protein sequences, and in the investigation of molecular phylogeny. String matching is also one of the central and most widely studied problems in theoretical computer science. The simplest form of the problem is to locate an occurrence of a keyword as a substring in a sequence of characters, which is called the input string. For example, the input string queueing contains the keyword ueuei as a substring. Even for this problem, several innovative, theoretically interesting algorithms have been devised that run significantly faster than the obvious brute-force method.} |
|
28 } |
|
29 |
|
30 %% back-references-------------------- |
8 |
31 |
9 @article{fowler2003, |
32 @article{fowler2003, |
10 title={An interpretation of the POSIX regex standard}, |
33 title={An interpretation of the POSIX regex standard}, |
11 author={Fowler, Glenn}, |
34 author={Fowler, Glenn}, |
12 journal={URL: https://web. archive. org/web/20050408073627/http://www. research. att. com/\~{} gsf/testregex/re-interpretation. html}, |
35 journal={URL: https://web. archive. org/web/20050408073627/http://www. research. att. com/\~{} gsf/testregex/re-interpretation. html}, |
204 title = {regexploit}, |
227 title = {regexploit}, |
205 url = {https://github.com/doyensec/regexploit}, |
228 url = {https://github.com/doyensec/regexploit}, |
206 year = {2021}, |
229 year = {2021}, |
207 bdsk-url-1 = {https://github.com/doyensec/regexploit}} |
230 bdsk-url-1 = {https://github.com/doyensec/regexploit}} |
208 |
231 |
|
232 @software{pcre, |
|
233 author = {Philip Hazel}, |
|
234 date-added = {1997-01-01 00:00:00 +0000}, |
|
235 date-modified = {2021-06-14 00:00:00 +0000}, |
|
236 keywords = {Perl Compatible Regular Expressions}, |
|
237 month = {June}, |
|
238 title = {PCRE}, |
|
239 url = {https://www.pcre.org/original/doc/html/}, |
|
240 year = {2021}, |
|
241 bdsk-url-1 = {https://www.pcre.org/original/doc/html/} |
|
242 } |
|
243 |
209 @misc{KuklewiczHaskell, |
244 @misc{KuklewiczHaskell, |
210 author = {Kuklewicz}, |
245 author = {Kuklewicz}, |
211 keywords = {Buggy C POSIX Lexing Libraries}, |
246 keywords = {Buggy C POSIX Lexing Libraries}, |
212 title = {Regex Posix}, |
247 title = {Regex Posix}, |
213 url = {https://wiki.haskell.org/Regex_Posix}, |
248 url = {https://wiki.haskell.org/Regex_Posix}, |