On Tuesday, April 10, 2012 4:39:27 PM UTC-4, Marco wrote:
> I didn't really understand what we were supposed to do:
> "Give pseudo code for a recognizer for the language defined by an NFA with States S, initial state i, final states F and transition function T. Assume the input string is z = z1 z2 ... zn"
You were supposed to write a pseudocode for recognizer for NFA.
states <- { i }
for i from 1 to n
newstates <- U T[s, zi]
all s in states
states <- newstates
if states intersect F is not empty
accept
else
reject