1. 3
    Regular Expression Matching Can Be Simple And Fast (2007) compsci programming swtch.com
    guillaume avatar via guillaume 4 years ago | cached | 1 comment

  1.  

  2. 1
    bevacqua avatar bevacqua 4 years ago | link

    If I remember correctly, DFA is regex-directed, whereas NFA is text-directed, which explains the curves. It isn’t uncommon in modern programming languages to switch between both engines as they see fit