Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Regular expression
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==References== {{Refbegin|30em}} * {{cite book |last=Aho |first=Alfred V. |author-link=Alfred Aho |year=1990 |chapter=Algorithms for finding patterns in strings |editor-last=van Leeuwen |editor-first=Jan |editor-link=Jan van Leeuwen |title=Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity |publisher=The MIT Press |pages=255β300 }} * {{cite book |last1=Aho |first1=Alfred V. |last2=Ullman |first2=Jeffrey D. |author-link2=Jeffrey Ullman |year=1992 |title=Foundations of Computer Science |url=http://infolab.stanford.edu/~ullman/focs.html |chapter=Chapter 10. Patterns, Automata, and Regular Expressions |chapter-url=http://infolab.stanford.edu/~ullman/focs/ch10.pdf |access-date=2013-12-14 |archive-date=2020-10-07 |archive-url=https://web.archive.org/web/20201007183211/http://infolab.stanford.edu/~ullman/focs.html |url-status=live }} * {{cite journal |last=Aycock |first=John |title=A brief history of just-in-time |doi=10.1145/857076.857077 |journal=ACM Computing Surveys |volume=35 |issue=2 |pages=97β113 |date=June 2003 |citeseerx=10.1.1.97.3985 |s2cid=15345671 |url=https://www.cs.tufts.edu/comp/150CMP/papers/aycock03jit.pdf }} * {{cite book |publisher=The Open Group |url=http://pubs.opengroup.org/onlinepubs/007908799/xbd/re.html |section=Regular Expressions |title=The Single UNIX Specification, Version 2 |year=1997 |access-date=2011-12-13 |archive-date=2020-10-07 |archive-url=https://web.archive.org/web/20201007183212/https://pubs.opengroup.org/onlinepubs/007908799/xbd/re.html |url-status=live }} * {{cite journal |publisher=The Open Group |url=http://pubs.opengroup.org/onlinepubs/009695399/basedefs/xbd_chap09.html |title=Chapter 9: Regular Expressions |journal=The Open Group Base Specifications |issue=6 |id=IEEE Std 1003.1, 2004 Edition |year=2004 |access-date=2011-12-13 |archive-date=2011-12-02 |archive-url=https://web.archive.org/web/20111202145637/http://pubs.opengroup.org/onlinepubs/009695399/basedefs/xbd_chap09.html |url-status=live }} * {{cite web |url=https://swtch.com/~rsc/regexp/regexp1.html |title=Regular Expression Matching Can Be Simple and Fast |last=Cox |first=Russ |year=2007 |access-date=2008-04-27 |archive-date=2010-01-01 |archive-url=https://web.archive.org/web/20100101190447/http://swtch.com/~rsc/regexp/regexp1.html }} * {{cite book |last=Forta |first=Ben |author-link=Ben Forta |year=2004 |title=Sams Teach Yourself Regular Expressions in 10 Minutes |publisher=Sams |isbn=978-0-672-32566-3 }} * {{cite book |last=Friedl |first=Jeffrey E. F. |year=2002 |title=Mastering Regular Expressions |url=http://regex.info/ |publisher=[[O'Reilly Media|O'Reilly]] |isbn=978-0-596-00289-3 |access-date=2005-04-26 |archive-date=2005-08-30 |archive-url=https://web.archive.org/web/20050830113350/http://regex.info/ |url-status=live }} * {{cite conference |last1=Gelade |first1=Wouter |last2=Neven |first2=Frank |title=Succinctness of the Complement and Intersection of Regular Expressions |pages=325β336 |work=Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008) |url=http://drops.dagstuhl.de/opus/volltexte/2008/1354 |year=2008 |arxiv=0802.2869 |access-date=2009-06-15 |archive-date=2011-07-18 |archive-url=https://web.archive.org/web/20110718225605/http://drops.dagstuhl.de/opus/volltexte/2008/1354/ }} * {{cite book |last1=Goyvaerts |first1=Jan |last2=Levithan |first2=Steven |year=2009 |title=Regular Expressions Cookbook |publisher=[O'reilly] |isbn=978-0-596-52068-7 }} * {{cite conference |last1=Gruber |first1=Hermann |last2=Holzer |first2=Markus |title=Finite Automata, Digraph Connectivity, and Regular Expression Size |pages=39β50 |work=Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008) |series=Lecture Notes in Computer Science |url=http://www.hermann-gruber.com/data/icalp08.pdf |year=2008 |doi=10.1007/978-3-540-70583-3_4 |volume=5126 |isbn=978-3-540-70582-6 |access-date=2011-02-03 |archive-date=2011-07-11 |archive-url=https://web.archive.org/web/20110711163607/http://www.hermann-gruber.com/data/icalp08.pdf |url-status=live }} * {{cite book |last=Habibi |first=Mehran |year=2004 |title=Real World Regular Expressions with Java 1.4 |publisher=Springer |isbn=978-1-59059-107-9 }} * {{cite book |last1=Hopcroft |first1=John E. |last2=Motwani |first2=Rajeev |last3=Ullman |first3=Jeffrey D. |title=Introduction to Automata Theory, Languages, and Computation |publisher=Addison-Wesley |year=2000 |edition=2nd }} * {{cite journal |last1=Johnson |first1=Walter L. |last2=Porter |first2=James H. |last3=Ackley |first3=Stephanie I. |last4=Ross |first4=Douglas T. |title=Automatic generation of efficient lexical processors using finite state techniques |doi=10.1145/364175.364185 |journal=Communications of the ACM |volume=11 |issue=12 |pages=805β813 |date=1968 |s2cid=17253809 |doi-access=free }} * {{cite book |last=Kleene |first=Stephen C. |chapter=Representation of Events in Nerve Nets and Finite Automata |title=Automata Studies |editor1-last=Shannon |editor1-first=Claude E. |editor2-last=McCarthy |editor2-first=John |url=https://www.rand.org/content/dam/rand/pubs/research_memoranda/2008/RM704.pdf |publisher=Princeton University Press |year=1951 |pages=3β42 |access-date=2017-12-10 |archive-date=2020-10-07 |archive-url=https://web.archive.org/web/20201007183213/https://www.rand.org/content/dam/rand/pubs/research_memoranda/2008/RM704.pdf |url-status=live }} * {{cite book |last=Kozen |first=Dexter |chapter=A completeness theorem for Kleene algebras and the algebra of regular events |title=[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science |pages=214β225 |year=1991 |hdl=1813/6963 |doi=10.1109/LICS.1991.151646 |isbn=978-0-8186-2230-4 |s2cid=19875225 }} * {{cite web |url=http://www.laurikari.net/tre/ |title=TRE library 0.7.6 |last=Laurikari |first=Ville |year=2009 |access-date=2009-04-01 |archive-date=2010-07-14 |archive-url=https://web.archive.org/web/20100714224701/http://laurikari.net/tre/ }} * {{cite book |last1=Liger |first1=FranΓ§ois |last2=McQueen |first2=Craig |last3=Wilton |first3=Paul |year=2002 |title=Visual Basic .NET Text Manipulation Handbook |publisher=[[Wrox Press]] |isbn=978-1-86100-730-8 }} * {{cite book |last=Sipser |first=Michael |author-link=Michael Sipser |year=1998 |title=Introduction to the Theory of Computation |chapter=Chapter 1: Regular Languages |pages=[https://archive.org/details/introductiontoth00sips/page/31 31β90] |publisher=PWS Publishing |isbn=978-0-534-94728-6 |chapter-url-access=registration |chapter-url=https://archive.org/details/introductiontoth00sips/page/31 }} * {{cite book |last=Stubblebine |first=Tony |year=2003 |title=Regular Expression Pocket Reference |publisher=O'Reilly |isbn=978-0-596-00415-6 }} * {{cite journal |last=Thompson |first=Ken |author-link=Ken Thompson |title=Programming Techniques: Regular expression search algorithm |doi=10.1145/363347.363387 |journal=Communications of the ACM |volume=11 |issue=6 |pages=419β422 |year=1968 |s2cid=21260384 |doi-access=free}} * {{cite web |url=http://dev.perl.org/perl6/doc/design/apo/A05.html |title=Apocalypse 5: Pattern Matching |last=Wall |first=Larry |author-link=Larry Wall |date=2002 |access-date=2006-10-11 |archive-date=2010-01-12 |archive-url=https://web.archive.org/web/20100112232513/http://dev.perl.org/perl6/doc/design/apo/A05.html |url-status=live }} {{Refend}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)