README.txt

__________     ___.              _____          __                         __ 
\______   \__ _\_ |__ ___.__.   /  _  \  __ ___/  |_  ____   _____ _____ _/  |______
 |       _/  |  \ __ <   |  |  /  /_\  \|  |  \   __\/  _ \ /     \\__  \\   __\__  \
 |    |   \  |  / \_\ \___  | /    |    \  |  /|  | (  <_> )  Y Y  \/ __ \|  |  / __ \_
 |____|_  /____/|___  / ____| \____|__  /____/ |__|  \____/|__|_|  (____  /__| (____  /

NFA, DFA & a low-budget regex implementation in Ruby

1. NFA & DFA can generate state-machine diagrams via Graphviz
2. NFA & DFA can be generated from graphviz files
3. Uses McNaughton-Yamada-Thompson to create regex

             ( _)                ( _)
            / / \\              / /\_\_
           / /   \\            / / | \ \
          / /     \\          / /  |\ \ \
         /  /   ,  \ ,       / /   /|  \ \
        /  /    |\_ /|      / /   / \   \_\
       /  /  |\/ _ '_|\    / /   /   \    \\
      |  /   |/  0 \0\ \  / |    |    \    \\
      |    |\|      \_\_ /  /    |     \    \\
      |  | |/    \.\ o\o)  /      \     |    \\
      \    |     /\\`v-v  /        |    |     \\
       | \/    /_| \\_|  /         |    | \    \\
       | |    /__/_     /   _____  |    |  \    \\
       \|    [__]  \_/  |_________  \   |   \    ()
        /    [___] (    \         \  |\ |   |   //
       |    [___]                  |\| \|   /  |/
      /|    [____]                  \  |/\ / / ||
 snd (  \   [____ /     ) _\      \  \    \| | ||
      \  \  [_____|    / /     __/    \   / / //
      |   \ [_____/   / /        \    |   \/ //
      |   /  '----|   /=\____   _/    |   / //
   __ /  /        |  /   ___/  _/\    \  | ||
  (/-(/-\)       /   \  (/\/\)/  |    /  | /
                (/\/\)           /   /   //
                       _________/   /    /
                      \____________/    (