<p>As the other answers claim, lookarounds don't add any extra power to regular expressions.</p>

<p>I think we can show this using the following:</p>

<p><a href="http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.5127v1.pdf" rel="noreferrer">One Pebble 2-NFA</a> (see the Introduction section of the paper which refers to it).</p>

<p>The 1-pebble 2NFA does not deal with nested lookaheads, but, we can use a variant of multi-pebble 2NFAs (see section below).</p>

<p><strong>Introduction</strong></p>

<p>A 2-NFA is a non deterministic finite automaton which has the ability to move either left or right on it's input.</p>

<p>A one pebble machine is where the machine can place a pebble on the input tape (i.e. mark a specific input symbol with a pebble) and do possibly different transitions based on whether there is a pebble at the current input position or not.</p>

<p>It is known the One Pebble 2-NFA has the same power as a regular DFA.</p>

<p><strong>Non-nested Lookaheads</strong></p>

<p>The basic idea is as follows:</p>

<p>The 2NFA allows us to backtrack (or 'front track') by moving forward or backward in the input tape. So for a lookahead we can do the match for the lookahead regular expression and then backtrack what we have consumed, in matching the lookahead expression. In order to know exactly when to stop backtracking, we use the pebble! We drop the pebble before we enter the dfa for the lookahead to mark the spot where the backtracking needs to stop.</p>

<p>Thus at the end of running our string through the pebble 2NFA, we know whether we matched the lookahead expression or not and the input left (i.e. what is left to be consumed) is exactly what is required to match the remaining.</p>

<p>So for a lookahead of the form u(?=v)w</p>

<p>We have the DFAs for u, v and w.</p>

<p>From the accepting state (yes, we can assume there is only one) of DFA for u, we make an e-transition to the start state of v, marking the input with a pebble.</p>

<p>From an accepting state for v, we e-transtion to a state which keeps moving the input left, till it finds a pebble, and then transitions to start state of w.</p>

<p>From a rejecting state of v, we e-transition to a state which keeps moving left until it finds the pebble, and transtions to the accepting state of u (i.e where we left off).</p>

<p>The proof used for regular NFAs to show r1 | r2, or r* etc, carry over for these one pebble 2nfas. See <a href="http://www.coli.uni-saarland.de/projects/milca/courses/coal/html/node41.html#regularlanguages.sec.regexptofsa" rel="noreferrer">http://www.coli.uni-saarland.de/projects/milca/courses/coal/html/node41.html#regularlanguages.sec.regexptofsa</a> for more info on how the component machines are put together to give the bigger machine for the r* expression etc.</p>

<p>The reason why the above proofs for r* etc work is that the backtracking ensures that the input pointer is always at the right spot, when we enter the component nfas for repetition. Also, if a pebble is in use, then it is being processed by one of the lookahead component machines. Since there are no transitions from lookahead machine to lookahead machine without completely backtracking and getting back the pebble, a one pebble machine is all that is needed.</p>

<p>For eg consider ([^a] | a(?=...b))*</p>

<p>and the string abbb.</p>

<p>We have abbb which goes through the peb2nfa for a(?=...b), at the end of which we are at the state: (bbb, matched) (i.e in input bbb is remaining, and it has matched 'a' followed by '..b'). Now because of the *, we go back to the beginning (see the construction in the link above), and enter the dfa for [^a]. Match b, go back to beginning, enter [^a] again two times, and then accept.</p>

<p><strong>Dealing with Nested Lookaheads</strong></p>

<p>To handle nested lookaheads we can use a restricted version of k-pebble 2NFA as defined here: <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.3984" rel="noreferrer">Complexity Results for Two-Way and Multi-Pebble Automata and their Logics</a> (see Definition 4.1 and Theorem 4.2).</p>

<p>In general, 2 pebble automata can accept non-regular sets, but with the following restrictions, k-pebble automata can be shown to be regular (Theorem 4.2 in above paper).</p>

<p>If the pebbles are P_1, P_2, ..., P_K</p>

<ul>
<li><p>P_{i+1} may not be placed unless P_i is already on the tape and P_{i} may not be picked up unless P_{i+1} is not on the tape. Basically the pebbles need to be used in a LIFO fashion.</p></li>
<li><p>Between the time P_{i+1} is placed and the time that either P_{i} is picked up or P_{i+2} is placed, the automaton can traverse only the subword located between the current location of P_{i} and the end of the input word that lies in the direction of P_{i+1}. Moreover, in this sub-word, the automaton can act only as a 1-pebble automaton with Pebble P_{i+1}. In particular it is not allowed to lift up, place or even sense the presence of another pebble.</p></li>
</ul>

<p>So if v is a nested lookahead expression of depth k, then (?=v) is a nested lookahead expression of depth k+1. When we enter a lookahead machine within, we know exactly how many pebbles have to have been placed so far and so can exactly determine which pebble to place and when we exit that machine, we know which pebble to lift.  All machines at depth t are entered by placing pebble t and exited (i.e. we return to processing of a depth t-1 machine) by removing pebble t. Any run of the complete machine looks like a recursive dfs call of a tree and the above two restrictions of the multi-pebble machine can be catered to.</p>

<p>Now when you combine expressions, for rr1, since you concat, the pebble numbers of r1 must be incremented by the depth of r. For r* and r|r1 the pebble numbering remains the same.</p>

<p>Thus any expression with lookaheads can be converted to an equivalent multi-pebble machine with the above restrictions in pebble placement and so is regular.</p>

<p><strong>Conclusion</strong></p>

<p>This basically addresses the drawback in Francis's original proof: being able to prevent the lookahead expressions from consuming anything which are required for future matches.</p>

<p>Since Lookbehinds are just finite string (not really regexs) we can deal with them first, and then deal with the lookaheads.</p>

<p>Sorry for the incomplete writeup, but a complete proof would involve drawing a lot of figures.</p>

<p>It looks right to me, but I will be glad to know of any mistakes (which I seem to be fond of :-)).</p>
Does lookaround affect which languages can be matched by regular expressions?
<p>There are some features in modern regex engines which allow you to match languages that couldn't be matched without that feature. For example the following regex using back references matches the language of all strings that consist of a word that repeats itself: <code>(.+)\1</code>. This language is not regular and can't be matched by a regex that does not use back references.</p>

<p>Does lookaround also affect which languages can be matched by a regular expression? I.e. are there any languages that can be matched using lookaround that couldn't be matched otherwise? If so, is this true for all flavors of lookaround (negative or positive lookahead or lookbehind) or just for some of them?</p>