# HG changeset patch
# User Chengsong
# Date 1582542225 0
# Node ID 93a34bbedebe63f605b3658670eaa4b8ad57c2d3
# Parent  8c404da3cb492ee4059326e972f4f28681d52122
version without tree

ii: Enter commit message.  Lines beginning with 'HG:' are removed.

diff -r 8c404da3cb49 -r 93a34bbedebe etnms/etnms.tex
--- a/etnms/etnms.tex	Mon Feb 24 11:02:11 2020 +0000
+++ b/etnms/etnms.tex	Mon Feb 24 11:03:45 2020 +0000
@@ -1551,35 +1551,7 @@
 $r \gg \textit{bs}$.
 The $\gg$ operator with the
 regular expression $r$ may also be seen as a 
-machine that does a derivative of regular expressions
-on all strings simultaneously, taking 
-the bits by going throught the regular expression tree
- structure in a depth first manner, regardless of whether
- the part being traversed is nullable or not.
- It put all possible bits that can be produced on such a traversal
- into a set.
- For example, if we are given the regular expression 
-$((a+b)(c+d))^*$, the tree structure may be written as\\
-\\
-\\
-\\
-\\
-\\
-\\
-\begin{center}
-\begin{tikzpicture}
-\tikz[tree layout]\graph[nodes={draw, circle}] {
-* -> 
-    {@-> {
-    {+1 ->
-        {a , b}
-        },
-    {+ ->
-        {c , d }
-        }
-        }
-    }
-};
+
 \end{tikzpicture}
 \end{center}
 \subsection{the $\textit{ders}_2$ Function}