| author | Chengsong | 
| Mon, 24 Feb 2020 11:02:11 +0000 | |
| changeset 136 | 8c404da3cb49 | 
| parent 135 | 0ed8053dcf21 | 
| child 137 | 93a34bbedebe | 
| etnms/etnms.tex | file | annotate | diff | comparison | revisions | 
--- a/etnms/etnms.tex Fri Feb 21 23:17:32 2020 +0000 +++ b/etnms/etnms.tex Mon Feb 24 11:02:11 2020 +0000 @@ -1559,7 +1559,13 @@ 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 +$((a+b)(c+d))^*$, the tree structure may be written as\\ +\\ +\\ +\\ +\\ +\\ +\\ \begin{center} \begin{tikzpicture} \tikz[tree layout]\graph[nodes={draw, circle}] {