dandy 0.1.10

Implementation of DFAs, NFAs and regular expressions together with a file format
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

# An ε-NFA.

     ε    a       b

→ s₀ {}   {s₁}    {s₀ s₂}
  s₁ {s₂} {s₄}    {s₃}
  s₂ {}   {s₁ s₄} {s₃}
  s₃ {s₅} {s₄ s₅} {}
  s₄ {s₃} {}      {s₅}
* s₅ {}   {s₅}    {s₅}

# to dfa:
#                      a                  b
# -> {s0}              {s1 s2}            {s0 s2}
#    {s1 s2}           {s1 s2 s3 s4 s5}   {s3 s5}
#    {s0 s2}           {s1 s2 s3 s4 s5}   {s0 s2 s3 s5}
#  * {s1 s2 s3 s4 s5}  {s1 s2 s3 s4 s5}   {s3 s5}
#  * {s3 s5}           {s3 s4 s5}         {s5}
#  * {s0 s2 s3 s5}     {s1 s2 s3 s4 s5}   {s0 s2 s3 s5}
#  * {s3 s4 s5}        {s3 s4 s5}         {s5}
#  * {s5}              {s5}               {s5}

# renamed states: (see eq_to_nfa1.dfa)
#       a b
# -> a  b c
#    b  d e
#    c  d f
#  * d  d e
#  * e  g h
#  * f  d f
#  * g  g h
#  * h  h h