[perl #40293] perlsec talks erroneously about "Non-Finite Automaton"

From: premchai21@yahoo.com (via RT) <perlbug-followup@perl.org>
Message-ID: <rt-3.5.HEAD-31258-1157609470-1994.40293-75-0@perl.org>

p4raw-id: //depot/perl@28800

diff --git a/pod/perlsec.pod b/pod/perlsec.pod
index 32a408a..0068d7c 100644 (file)
--- a/pod/perlsec.pod
+++ b/pod/perlsec.pod
@@ -480,9 +480,9 @@ Algorithm::FastPermute), or for any cryptographic applications.
 
 =item *
 
-Regular expressions - Perl's regular expression engine is so called
-NFA (Non-Finite Automaton), which among other things means that it can
-rather easily consume large amounts of both time and space if the
+Regular expressions - Perl's regular expression engine is so called NFA
+(Non-deterministic Finite Automaton), which among other things means that
+it can rather easily consume large amounts of both time and space if the
 regular expression may match in several ways.  Careful crafting of the
 regular expressions can help but quite often there really isn't much
 one can do (the book "Mastering Regular Expressions" is required