Regular expression (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Regular expression" in English language version.

refsWebsite

Global rank English rank

36web.archive.org

1^st place

8doi.org

2^nd place

5semanticscholar.org

11^th place

8^th place

4arxiv.org

69^th place

59^th place

4github.com

383^rd place

320^th place

4perl.org

low place

9,807^th place

3regular-expressions.info

low place

2books.google.com

3^rd place

2rand.org

2,921^st place

2,118^th place

2bell-labs.com

5,739^th place

4,857^th place

2dagstuhl.de

low place

2swtch.com

low place

1howtogeek.com

6,527^th place

4,344^th place

1nmsu.edu

6,873^rd place

4,881^st place

1princeton.edu

741^st place

577^th place

1stanford.edu

179^th place

183^rd place

1tufts.edu

155^th place

138^th place

1psu.edu

207^th place

136^th place

1catb.org

3,959^th place

3,208^th place

1tcl.tk

low place

1postgresql.org

low place

8,344^th place

1pcre.org

low place

1grovf.com

low place

1bkase.github.io

low place

1man7.org

low place

1archive.org

6^th place

1hermann-gruber.com

low place

1boskent.com

low place

1handle.net

102^nd place

76^th place

1imath.kiev.ua

low place

1opengroup.org

3,671^st place

2,607^th place

1python.org

2,232^nd place

1,903^rd place

1oracle.com

1,514^th place

1,024^th place

1ietf.org

214^th place

176^th place

1157.5

low place

1plover.com

low place

1archive-it.org

910^th place

593^rd place

1stackexchange.com

1,983^rd place

1,330^th place

1laurikari.net

low place

1gnu.org

1,475^th place

1,188^th place

1uchile.cl

2,951^st place

6,086^th place

1sourceforge.net

1,669^th place

1,290^th place

1unicode.org

311^th place

239^th place

1googleblog.blogspot.com

3,598^th place

3,448^th place

1scribd.com

482^nd place

552^nd place

157.5

137.149.157.5

Cezar Câmpeanu; Kai Salomaa & Sheng Yu (Dec 2003). "A Formal Study of Practical Regular Expressions". International Journal of Foundations of Computer Science. 14 (6): 1007–1018. doi:10.1142/S012905410300214X. Archived from the original on 2015-07-04. Retrieved 2015-07-03. Theorem 3 (p.9)

archive-it.org

wayback.archive-it.org

Ritchie, D. M.; Thompson, K. L. (June 1970). QED Text Editor (PDF). MM-70-1373-3. Archived from the original (PDF) on 2015-02-03. Retrieved 2022-09-05. Reprinted as "QED Text Editor Reference Manual", MHCC-004, Murray Hill Computing, Bell Laboratories (October 1972).

archive.org

Sipser (1998) Sipser, Michael (1998). "Chapter 1: Regular Languages". Introduction to the Theory of Computation. PWS Publishing. pp. 31–90. ISBN 978-0-534-94728-6.

arxiv.org

Gelade & Neven (2008, p. 332, Thm.4.1) Gelade, Wouter; Neven, Frank (2008). Succinctness of the Complement and Intersection of Regular Expressions. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). pp. 325–336. arXiv:0802.2869. Archived from the original on 2011-07-18. Retrieved 2009-06-15.
Based on Gelade & Neven (2008), a regular expression of length about 850 such that its complement has a length about 2³² can be found at File:RegexComplementBlowup.png. Gelade, Wouter; Neven, Frank (2008). Succinctness of the Complement and Intersection of Regular Expressions. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). pp. 325–336. arXiv:0802.2869. Archived from the original on 2011-07-18. Retrieved 2009-06-15.
Kearns, Steven (August 2013). "Sublinear Matching With Finite Automata Using Reverse Suffix Scanning". arXiv:1308.3822 [cs.DS].
Schmid, Markus L. (March 2019). "Regular Expressions with Backreferences: Polynomial-Time Matching Techniques". arXiv:1903.05896 [cs.FL].

bell-labs.com

cm.bell-labs.com

Ritchie, Dennis M. "An incomplete history of the QED Text Editor". Archived from the original on 1999-02-21. Retrieved 9 October 2013.
Ritchie, D. M.; Thompson, K. L. (June 1970). QED Text Editor (PDF). MM-70-1373-3. Archived from the original (PDF) on 2015-02-03. Retrieved 2022-09-05. Reprinted as "QED Text Editor Reference Manual", MHCC-004, Murray Hill Computing, Bell Laboratories (October 1972).

bkase.github.io

"CUDA grep". bkase.github.io. Archived from the original on 2020-10-07. Retrieved 2019-10-22.

books.google.com

Mitkov, Ruslan (2003). The Oxford Handbook of Computational Linguistics. Oxford University Press. p. 754. ISBN 978-0-19-927634-9. Archived from the original on 2017-02-28. Retrieved 2016-07-25.
Lawson, Mark V. (17 September 2003). Finite Automata. CRC Press. pp. 98–100. ISBN 978-1-58488-255-8. Archived from the original on 27 February 2017. Retrieved 25 July 2016.

boskent.com

s3.boskent.com

"Regular expressions for deciding divisibility". s3.boskent.com. Retrieved 2024-02-21.

catb.org

Raymond, Eric S. citing Dennis Ritchie (2003). "Jargon File 4.4.7: grep". Archived from the original on 2011-06-05. Retrieved 2009-02-17.

dagstuhl.de

drops.dagstuhl.de

Gelade & Neven (2008, p. 332, Thm.4.1) Gelade, Wouter; Neven, Frank (2008). Succinctness of the Complement and Intersection of Regular Expressions. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). pp. 325–336. arXiv:0802.2869. Archived from the original on 2011-07-18. Retrieved 2009-06-15.
Based on Gelade & Neven (2008), a regular expression of length about 850 such that its complement has a length about 2³² can be found at File:RegexComplementBlowup.png. Gelade, Wouter; Neven, Frank (2008). Succinctness of the Complement and Intersection of Regular Expressions. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). pp. 325–336. arXiv:0802.2869. Archived from the original on 2011-07-18. Retrieved 2009-06-15.

doi.org

Thompson 1968. Thompson, Ken (1968). "Programming Techniques: Regular expression search algorithm". Communications of the ACM. 11 (6): 419–422. doi:10.1145/363347.363387. S2CID 21260384.
Johnson et al. 1968. Johnson, Walter L.; Porter, James H.; Ackley, Stephanie I.; Ross, Douglas T. (1968). "Automatic generation of efficient lexical processors using finite state techniques". Communications of the ACM. 11 (12): 805–813. doi:10.1145/364175.364185. S2CID 17253809.
Aycock 2003, p. 98. Aycock, John (June 2003). "A brief history of just-in-time" (PDF). ACM Computing Surveys. 35 (2): 97–113. CiteSeerX 10.1.1.97.3985. doi:10.1145/857076.857077. S2CID 15345671.
Gruber & Holzer (2008) Gruber, Hermann; Holzer, Markus (2008). Finite Automata, Digraph Connectivity, and Regular Expression Size (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008). Lecture Notes in Computer Science. Vol. 5126. pp. 39–50. doi:10.1007/978-3-540-70583-3_4. ISBN 978-3-540-70582-6. Archived (PDF) from the original on 2011-07-11. Retrieved 2011-02-03.
Kozen (1991)^{[page needed]} Kozen, Dexter (1991). "A completeness theorem for Kleene algebras and the algebra of regular events". [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science. pp. 214–225. doi:10.1109/LICS.1991.151646. hdl:1813/6963. ISBN 978-0-8186-2230-4. S2CID 19875225.
Bormann, Carsten; Bray, Tim. I-Regexp: An Interoperable Regular Expression Format. Internet Engineering Task Force. doi:10.17487/RFC9485. RFC 9485. Retrieved 11 March 2024.
Cezar Câmpeanu; Kai Salomaa & Sheng Yu (Dec 2003). "A Formal Study of Practical Regular Expressions". International Journal of Foundations of Computer Science. 14 (6): 1007–1018. doi:10.1142/S012905410300214X. Archived from the original on 2015-07-04. Retrieved 2015-07-03. Theorem 3 (p.9)
Navarro, Gonzalo (10 November 2001). "NR-grep: a fast and flexible pattern-matching tool" (PDF). Software: Practice and Experience. 31 (13): 1265–1312. doi:10.1002/spe.411. S2CID 3175806. Archived (PDF) from the original on 7 October 2020. Retrieved 21 November 2019.

github.com

SRE: Atomic Grouping (?>...) is not supported #34627
Wall, Larry (1994-10-18). "Perl 5: perlre.pod". GitHub.
Zakharevich, Ilya (1997-11-19). "Jumbo Regexp Patch Applied (with Minor Fix-Up Tweaks): Perl/perl5@c277df4". GitHub.
"travisdowns/polyregex". GitHub. 5 July 2019. Archived from the original on 14 September 2020. Retrieved 21 November 2019.

gnu.org

git.savannah.gnu.org

"gnulib/lib/dfa.c". Archived from the original on 2021-08-18. Retrieved 2022-02-12. If the scanner detects a transition on backref, it returns a kind of "semi-success" indicating that the match will have to be verified with a backtracking matcher.

googleblog.blogspot.com

Horowitz, Bradley (24 October 2011). "A fall sweep". Google Blog. Archived from the original on 21 October 2018. Retrieved 4 May 2019.

grovf.com

"GRegex – Faster Analytics for Unstructured Text Data". grovf.com. Archived from the original on 2020-10-07. Retrieved 2019-10-22.

handle.net

hdl.handle.net

Kozen (1991)^{[page needed]} Kozen, Dexter (1991). "A completeness theorem for Kleene algebras and the algebra of regular events". [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science. pp. 214–225. doi:10.1109/LICS.1991.151646. hdl:1813/6963. ISBN 978-0-8186-2230-4. S2CID 19875225.

hermann-gruber.com

Gruber & Holzer (2008) Gruber, Hermann; Holzer, Markus (2008). Finite Automata, Digraph Connectivity, and Regular Expression Size (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008). Lecture Notes in Computer Science. Vol. 5126. pp. 39–50. doi:10.1007/978-3-540-70583-3_4. ISBN 978-3-540-70582-6. Archived (PDF) from the original on 2011-07-11. Retrieved 2011-02-03.

howtogeek.com

Heddings, Anthony (11 March 2020). "How Do You Actually Use Regex?". howtogeek.com. Retrieved 24 February 2024.

ietf.org

datatracker.ietf.org

Bormann, Carsten; Bray, Tim. I-Regexp: An Interoperable Regular Expression Format. Internet Engineering Task Force. doi:10.17487/RFC9485. RFC 9485. Retrieved 11 March 2024.

imath.kiev.ua

umj.imath.kiev.ua

Redko, V.N. (1964). "On defining relations for the algebra of regular events". Ukrainskii Matematicheskii Zhurnal (in Russian). 16 (1): 120–126. Archived from the original on 2018-03-29. Retrieved 2018-03-28.

laurikari.net

Laurikari (2009) Laurikari, Ville (2009). "TRE library 0.7.6". Archived from the original on 2010-07-14. Retrieved 2009-04-01.

man7.org

Kerrisk, Michael. "grep(1) - Linux manual page". man7.org. Retrieved 31 January 2023.

nmsu.edu

cs.nmsu.edu

Leung, Hing (16 September 2010). "Regular Languages and Finite Automata" (PDF). New Mexico State University. Archived from the original (PDF) on 5 December 2013. Retrieved 13 August 2019. The concept of regular events was introduced by Kleene via the definition of regular expressions.

opengroup.org

pubs.opengroup.org

"9.3.6 BREs Matching Multiple Characters". The Open Group Base Specifications Issue 7, 2018 edition. The Open Group. 2017. Retrieved December 10, 2023.

oracle.com

docs.oracle.com

"Essential classes: Regular Expressions: Quantifiers: Differences Among Greedy, Reluctant, and Possessive Quantifiers". The Java Tutorials. Oracle. Archived from the original on 7 October 2020. Retrieved 23 December 2016.

pcre.org

"PCRE - Perl Compatible Regular Expressions". www.pcre.org. Retrieved 2024-04-07.

perl.org

perldoc.perl.org

Wall, Larry (2006). "Perl Regular Expressions". perlre. Archived from the original on 2009-12-31. Retrieved 2006-10-10.
"Perl Regular Expression Documentation". perldoc.perl.org. Archived from the original on December 31, 2009. Retrieved November 5, 2024.
The character 'm' is not always required to specify a Perl match operation. For example, m/[^abc]/ could also be rendered as /[^abc]/. The 'm' is only necessary if the user wishes to specify a match operation without using a forward-slash as the regex delimiter. Sometimes it is useful to specify an alternate regex delimiter in order to avoid "delimiter collision". See 'perldoc perlre Archived 2009-12-31 at the Wayback Machine' for more details.

dev.perl.org

Wall (2002) Wall, Larry (2002). "Apocalypse 5: Pattern Matching". Archived from the original on 2010-01-12. Retrieved 2006-10-11.

plover.com

perl.plover.com

"Perl Regular Expression Matching is NP-Hard". perl.plover.com. Archived from the original on 2020-10-07. Retrieved 2019-11-21.

postgresql.org

"Documentation: 9.3: Pattern Matching". PostgreSQL. Archived from the original on 2020-10-07. Retrieved 2013-10-12.

princeton.edu

cs.princeton.edu

Kernighan, Brian (2007-08-08). "A Regular Expressions Matcher". Beautiful Code. O'Reilly Media. pp. 1–2. ISBN 978-0-596-51004-6. Archived from the original on 2020-10-07. Retrieved 2013-05-15.

psu.edu

citeseerx.ist.psu.edu

Aycock 2003, p. 98. Aycock, John (June 2003). "A brief history of just-in-time" (PDF). ACM Computing Surveys. 35 (2): 97–113. CiteSeerX 10.1.1.97.3985. doi:10.1145/857076.857077. S2CID 15345671.

python.org

docs.python.org

"Regular Expression Syntax". Python 3.5.0 documentation. Python Software Foundation. Archived from the original on 18 July 2018. Retrieved 10 October 2015.

rand.org

Kleene 1951. Kleene, Stephen C. (1951). "Representation of Events in Nerve Nets and Finite Automata". In Shannon, Claude E.; McCarthy, John (eds.). Automata Studies (PDF). Princeton University Press. pp. 3–42. Archived (PDF) from the original on 2020-10-07. Retrieved 2017-12-10.
Kleene 1951, pg46

regular-expressions.info

Goyvaerts, Jan. "Regular Expression Tutorial - Learn How to Use Regular Expressions". Regular-Expressions.info. Archived from the original on 2016-11-01. Retrieved 2016-10-31.
"How a Regex Engine Works Internally". regular-expressions.info. Retrieved 24 February 2024.
"Atomic Grouping". Regex Tutorial. Archived from the original on 7 October 2020. Retrieved 24 November 2019.

scribd.com

Conway, Damian (2005). "Regular Expressions, End of String". Perl Best Practices. O'Reilly. p. 240. ISBN 978-0-596-00173-5. Archived from the original on 2020-10-07. Retrieved 2017-09-10.

semanticscholar.org

api.semanticscholar.org

Thompson 1968. Thompson, Ken (1968). "Programming Techniques: Regular expression search algorithm". Communications of the ACM. 11 (6): 419–422. doi:10.1145/363347.363387. S2CID 21260384.
Johnson et al. 1968. Johnson, Walter L.; Porter, James H.; Ackley, Stephanie I.; Ross, Douglas T. (1968). "Automatic generation of efficient lexical processors using finite state techniques". Communications of the ACM. 11 (12): 805–813. doi:10.1145/364175.364185. S2CID 17253809.
Aycock 2003, p. 98. Aycock, John (June 2003). "A brief history of just-in-time" (PDF). ACM Computing Surveys. 35 (2): 97–113. CiteSeerX 10.1.1.97.3985. doi:10.1145/857076.857077. S2CID 15345671.
Kozen (1991)^{[page needed]} Kozen, Dexter (1991). "A completeness theorem for Kleene algebras and the algebra of regular events". [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science. pp. 214–225. doi:10.1109/LICS.1991.151646. hdl:1813/6963. ISBN 978-0-8186-2230-4. S2CID 19875225.
Navarro, Gonzalo (10 November 2001). "NR-grep: a fast and flexible pattern-matching tool" (PDF). Software: Practice and Experience. 31 (13): 1265–1312. doi:10.1002/spe.411. S2CID 3175806. Archived (PDF) from the original on 7 October 2020. Retrieved 21 November 2019.

sourceforge.net

vimdoc.sourceforge.net

"Vim documentation: pattern". Vimdoc.sourceforge.net. Archived from the original on 2020-10-07. Retrieved 2013-09-25.

stackexchange.com

cs.stackexchange.com

Wandering Logic. "How to simulate lookaheads and lookbehinds in finite state automata?". Computer Science Stack Exchange. Archived from the original on 7 October 2020. Retrieved 24 November 2019.

stanford.edu

infolab.stanford.edu

Aho & Ullman 1992, 10.11 Bibliographic Notes for Chapter 10, p. 589. Aho, Alfred V.; Ullman, Jeffrey D. (1992). "Chapter 10. Patterns, Automata, and Regular Expressions" (PDF). Foundations of Computer Science. Archived from the original on 2020-10-07. Retrieved 2013-12-14.

swtch.com

Russ Cox (2009). "Regular Expression Matching: the Virtual Machine Approach". swtch.com. Digression: POSIX Submatching
Cox (2007) Cox, Russ (2007). "Regular Expression Matching Can Be Simple and Fast". Archived from the original on 2010-01-01. Retrieved 2008-04-27.

tcl.tk

"New Regular Expression Features in Tcl 8.1". Archived from the original on 2020-10-07. Retrieved 2013-10-11.

tufts.edu

cs.tufts.edu

Aycock 2003, p. 98. Aycock, John (June 2003). "A brief history of just-in-time" (PDF). ACM Computing Surveys. 35 (2): 97–113. CiteSeerX 10.1.1.97.3985. doi:10.1145/857076.857077. S2CID 15345671.

uchile.cl

users.dcc.uchile.cl

Navarro, Gonzalo (10 November 2001). "NR-grep: a fast and flexible pattern-matching tool" (PDF). Software: Practice and Experience. 31 (13): 1265–1312. doi:10.1002/spe.411. S2CID 3175806. Archived (PDF) from the original on 7 October 2020. Retrieved 21 November 2019.

unicode.org

"UTS#18 on Unicode Regular Expressions, Annex A: Character Blocks". Archived from the original on 2020-10-07. Retrieved 2010-02-05.

web.archive.org

Goyvaerts, Jan. "Regular Expression Tutorial - Learn How to Use Regular Expressions". Regular-Expressions.info. Archived from the original on 2016-11-01. Retrieved 2016-10-31.
Mitkov, Ruslan (2003). The Oxford Handbook of Computational Linguistics. Oxford University Press. p. 754. ISBN 978-0-19-927634-9. Archived from the original on 2017-02-28. Retrieved 2016-07-25.
Lawson, Mark V. (17 September 2003). Finite Automata. CRC Press. pp. 98–100. ISBN 978-1-58488-255-8. Archived from the original on 27 February 2017. Retrieved 25 July 2016.
Kleene 1951. Kleene, Stephen C. (1951). "Representation of Events in Nerve Nets and Finite Automata". In Shannon, Claude E.; McCarthy, John (eds.). Automata Studies (PDF). Princeton University Press. pp. 3–42. Archived (PDF) from the original on 2020-10-07. Retrieved 2017-12-10.
Leung, Hing (16 September 2010). "Regular Languages and Finite Automata" (PDF). New Mexico State University. Archived from the original (PDF) on 5 December 2013. Retrieved 13 August 2019. The concept of regular events was introduced by Kleene via the definition of regular expressions.
Kernighan, Brian (2007-08-08). "A Regular Expressions Matcher". Beautiful Code. O'Reilly Media. pp. 1–2. ISBN 978-0-596-51004-6. Archived from the original on 2020-10-07. Retrieved 2013-05-15.
Ritchie, Dennis M. "An incomplete history of the QED Text Editor". Archived from the original on 1999-02-21. Retrieved 9 October 2013.
Aho & Ullman 1992, 10.11 Bibliographic Notes for Chapter 10, p. 589. Aho, Alfred V.; Ullman, Jeffrey D. (1992). "Chapter 10. Patterns, Automata, and Regular Expressions" (PDF). Foundations of Computer Science. Archived from the original on 2020-10-07. Retrieved 2013-12-14.
Raymond, Eric S. citing Dennis Ritchie (2003). "Jargon File 4.4.7: grep". Archived from the original on 2011-06-05. Retrieved 2009-02-17.
"New Regular Expression Features in Tcl 8.1". Archived from the original on 2020-10-07. Retrieved 2013-10-11.
"Documentation: 9.3: Pattern Matching". PostgreSQL. Archived from the original on 2020-10-07. Retrieved 2013-10-12.
Wall, Larry (2006). "Perl Regular Expressions". perlre. Archived from the original on 2009-12-31. Retrieved 2006-10-10.
Wall (2002) Wall, Larry (2002). "Apocalypse 5: Pattern Matching". Archived from the original on 2010-01-12. Retrieved 2006-10-11.
"GRegex – Faster Analytics for Unstructured Text Data". grovf.com. Archived from the original on 2020-10-07. Retrieved 2019-10-22.
"CUDA grep". bkase.github.io. Archived from the original on 2020-10-07. Retrieved 2019-10-22.
Gelade & Neven (2008, p. 332, Thm.4.1) Gelade, Wouter; Neven, Frank (2008). Succinctness of the Complement and Intersection of Regular Expressions. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). pp. 325–336. arXiv:0802.2869. Archived from the original on 2011-07-18. Retrieved 2009-06-15.
Gruber & Holzer (2008) Gruber, Hermann; Holzer, Markus (2008). Finite Automata, Digraph Connectivity, and Regular Expression Size (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008). Lecture Notes in Computer Science. Vol. 5126. pp. 39–50. doi:10.1007/978-3-540-70583-3_4. ISBN 978-3-540-70582-6. Archived (PDF) from the original on 2011-07-11. Retrieved 2011-02-03.
Based on Gelade & Neven (2008), a regular expression of length about 850 such that its complement has a length about 2³² can be found at File:RegexComplementBlowup.png. Gelade, Wouter; Neven, Frank (2008). Succinctness of the Complement and Intersection of Regular Expressions. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). pp. 325–336. arXiv:0802.2869. Archived from the original on 2011-07-18. Retrieved 2009-06-15.
Redko, V.N. (1964). "On defining relations for the algebra of regular events". Ukrainskii Matematicheskii Zhurnal (in Russian). 16 (1): 120–126. Archived from the original on 2018-03-29. Retrieved 2018-03-28.
"Perl Regular Expression Documentation". perldoc.perl.org. Archived from the original on December 31, 2009. Retrieved November 5, 2024.
"Regular Expression Syntax". Python 3.5.0 documentation. Python Software Foundation. Archived from the original on 18 July 2018. Retrieved 10 October 2015.
"Essential classes: Regular Expressions: Quantifiers: Differences Among Greedy, Reluctant, and Possessive Quantifiers". The Java Tutorials. Oracle. Archived from the original on 7 October 2020. Retrieved 23 December 2016.
"Atomic Grouping". Regex Tutorial. Archived from the original on 7 October 2020. Retrieved 24 November 2019.
Cezar Câmpeanu; Kai Salomaa & Sheng Yu (Dec 2003). "A Formal Study of Practical Regular Expressions". International Journal of Foundations of Computer Science. 14 (6): 1007–1018. doi:10.1142/S012905410300214X. Archived from the original on 2015-07-04. Retrieved 2015-07-03. Theorem 3 (p.9)
"Perl Regular Expression Matching is NP-Hard". perl.plover.com. Archived from the original on 2020-10-07. Retrieved 2019-11-21.
Wandering Logic. "How to simulate lookaheads and lookbehinds in finite state automata?". Computer Science Stack Exchange. Archived from the original on 7 October 2020. Retrieved 24 November 2019.
Cox (2007) Cox, Russ (2007). "Regular Expression Matching Can Be Simple and Fast". Archived from the original on 2010-01-01. Retrieved 2008-04-27.
Laurikari (2009) Laurikari, Ville (2009). "TRE library 0.7.6". Archived from the original on 2010-07-14. Retrieved 2009-04-01.
"gnulib/lib/dfa.c". Archived from the original on 2021-08-18. Retrieved 2022-02-12. If the scanner detects a transition on backref, it returns a kind of "semi-success" indicating that the match will have to be verified with a backtracking matcher.
Navarro, Gonzalo (10 November 2001). "NR-grep: a fast and flexible pattern-matching tool" (PDF). Software: Practice and Experience. 31 (13): 1265–1312. doi:10.1002/spe.411. S2CID 3175806. Archived (PDF) from the original on 7 October 2020. Retrieved 21 November 2019.
"travisdowns/polyregex". GitHub. 5 July 2019. Archived from the original on 14 September 2020. Retrieved 21 November 2019.
"Vim documentation: pattern". Vimdoc.sourceforge.net. Archived from the original on 2020-10-07. Retrieved 2013-09-25.
"UTS#18 on Unicode Regular Expressions, Annex A: Character Blocks". Archived from the original on 2020-10-07. Retrieved 2010-02-05.
Horowitz, Bradley (24 October 2011). "A fall sweep". Google Blog. Archived from the original on 21 October 2018. Retrieved 4 May 2019.
The character 'm' is not always required to specify a Perl match operation. For example, m/[^abc]/ could also be rendered as /[^abc]/. The 'm' is only necessary if the user wishes to specify a match operation without using a forward-slash as the regex delimiter. Sometimes it is useful to specify an alternate regex delimiter in order to avoid "delimiter collision". See 'perldoc perlre Archived 2009-12-31 at the Wayback Machine' for more details.
Conway, Damian (2005). "Regular Expressions, End of String". Perl Best Practices. O'Reilly. p. 240. ISBN 978-0-596-00173-5. Archived from the original on 2020-10-07. Retrieved 2017-09-10.